### Home Research Resume Contact Misc.

**Peace Through Superior Puzzling: An Asymmetric Sybil Defense**

Diksha Gupta, Jared Saia, and Maxwell Young.

**Abstract:** A common tool to defend against Sybil attacks is proof-of-work, whereby computational puzzles are used to limit the number of Sybil participants. Unfortunately, current Sybil defenses require significant computational effort to offset an attack. In particular, good participants must spend computationally at a rate that is proportional to the spending rate of an attacker.

In this paper, we present the first Sybil defense algorithm which is asymmetric in the sense that good participants spend at a rate that is asymptotically less than an attacker. In particular, if T is the rate of the attacker’s spending, and J is the rate of joining good participants, then our algorithm spends at a rate of O( sqrt{TJ} + J ).

We provide empirical evidence that our algorithm can be significantly more efficient than previous defenses under various attack scenarios. Additionally, we prove a lower bound showing that our algorithm’s spending rate is asymptotically optimal among a large family of algorithms.

*Source code for experimental results available here.*

Full paper: pdf