An analysis of social network-based Sybil defenses

  • Authors:

  • Bimal Viswanath;Ansley Post;Krishna P. Gummadi;Alan Mislove

  • Affiliations:

  • MPI-SWS, Kaiserslautern-Saarbruecken, Germany;MPI-SWS, Kaiserslautern-Saarbruecken, Germany;MPI-SWS, Kaiserslautern-Saarbruecken, Germany;Northeastern University, Boston, MA, USA

  • Venue:
  • Proceedings of the ACM SIGCOMM 2010 conference
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Recently, there has been much excitement in the research community over using social networks to mitigate multiple identity, or Sybil, attacks. A number of schemes have been proposed, but they differ greatly in the algorithms they use and in the networks upon which they are evaluated. As a result, the research community lacks a clear understanding of how these schemes compare against each other, how well they would work on real-world social networks with different structural properties, or whether there exist other (potentially better) ways of Sybil defense. In this paper, we show that, despite their considerable differences, existing Sybil defense schemes work by detecting local communities (i.e., clusters of nodes more tightly knit than the rest of the graph) around a trusted node. Our finding has important implications for both existing and future designs of Sybil defense schemes. First, we show that there is an opportunity to leverage the substantial amount of prior work on general community detection algorithms in order to defend against Sybils. Second, our analysis reveals the fundamental limits of current social network-based Sybil defenses: We demonstrate that networks with well-defined community structure are inherently more vulnerable to Sybil attacks, and that, in such networks, Sybils can carefully target their links in order make their attacks more effective.