Sybil defenses via social networks
Author:
Open Access
- 14 October 2011
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGACT News
- Vol. 42 (3) , 80-101
Abstract
The sybil attack in distributed systems refers to individual malicious users joining the system multiple times under multiple fake identities. Sybil attacks can easily invalidate the overarching prerequisite of many fault-tolerant designs which assume that the fraction of malicious nodes is not too large. This article presents a tutorial and survey on effective sybil defenses leveraging social networks. Since this approach of sybil defenses via social networks was introduced 5 years ago, it has attracted much more attention from the research community than many other alternatives. We will first explain the intuitions and insights behind this approach, and then survey a number of specific sybil defense mechanisms based on this approach, including SybilGuard, SybilLimit, SybilInfer, Gatekeeper, SumUp, Whanau, and Ostra. We will also discuss some practical implications and deployment considerations of this approach.Keywords
This publication has 23 references indexed in Scilit:
- Community detection in graphsPhysics Reports, 2010
- Correctness of Gossip-Based Membership under Message LossSIAM Journal on Computing, 2010
- Brahms: Byzantine resilient random membership samplingComputer Networks, 2009
- Statistical properties of community structure in large social and information networks2008
- How to spread adversarial nodes?2005
- Sybilproof reputation mechanisms2005
- Sybil-Resistant DHT Routing2005
- An Empirical Study of Free-Riding Behavior in the Maze P2P File-Sharing System2005
- Robust incentive techniques for peer-to-peer networks2004
- The sybil attack in sensor networks2004