column

Sybil defenses via social networks: a tutorial and survey

Author:

Haifeng YuAuthors Info & Claims

ACM SIGACT News, Volume 42, Issue 3

Pages 80 - 101

https://doi.org/10.1145/2034575.2034593

Published: 14 October 2011 Publication History

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.

References

[1]

R. Bazzi and G. Konjevod. On the establishment of distinct identities in overlay networks. In ACM PODC, 2005.

Digital Library

[2]

L. Bilge, T. Strufe, D. Balzarotti, and E. Kirda. All your contacts are belong to us: Automated identity theft attacks on social networks. In WWW, Apr. 2009.

Digital Library

[3]

E. Bortnikov, M. Gurevich, I. Keidar, G. Kliot, and A. Shraer. Brahms: Byzantine Resilient Random Membership Sampling. Computer Networks, 53(13), 2009.

Digital Library

[4]

S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah. Gossip algorithms: Design, analysis and applications. In IEEE INFOCOM, 2005.

[5]

A. Cheng and E. Friedman. Sybilproof reputation mechanisms. In ACM P2PEcon, 2005.

Digital Library

[6]

A. Cheng and E. Friedman. Manipulability of PageRank under Sybil Strategies. In Proceedings of the First Workshop of Networked Systems, 2006.

[7]

G. Danezis, C. Lesniewski-Laas, M. F. Kaashoek, and R. Anderson. Sybil-resistant DHT routing. In ESORICS, 2005. Springer-Verlag LNCS 3679.

Digital Library

[8]

G. Danezis and P. Mittal. SybilInfer: Detecting Sybil Nodes using Social Networks. In NDSS, 2009.

[9]

J. Douceur. The Sybil attack. In IPTPS, 2002.

Digital Library

[10]

M. Feldman, K. Lai, I. Stoica, and J. Chuang. Robust incentive techniques for peer-to-peer networks. In ACM Electronic Commerce, 2004.

Digital Library

[11]

A. Flaxman. Expansion and Lack Thereof in Randomly Perturbed Graphs. In International Workshop on Algorithms and Models for the Web-Graph, 2006.

[12]

S. Fortunato. Community detection in graphs. Physics Reports, 486(3-5), 2010.

[13]

M. Gurevich and I. Keidar. Correctness of Gossip-Based Membership under Message Loss. SIAM Journal on Computing, 39(8), 2010.

Digital Library

[14]

J. Kleinberg. The small-world phenomenon: An algorithmic perspective. In ACM STOC, 2000.

Digital Library

[15]

J. Leskovec, K. Lang, A. Dasgupta, and M. Mahoney. Statistical properties of community structure in large social and information networks. In WWW, 2008.

Digital Library

[16]

C. Lesniewski-Laas and M. F. Kaashoek. Whanau: A Sybil-proof Distributed Hash Table. In NSDI, Apr. 2010.

Digital Library

[17]

Q. Lian, Z. Zhang, M. Yang, B. Y. Zhao, Y. Dai, and X. Li. An empirical study of collusion behavior in the Maze P2P file-sharing system. In IEEE ICDCS, 2007.

Digital Library

[18]

A. Mislove, A. Post, P. Druschel, and K. Gummadi. Ostra: Leveraging trust to thwart unwanted communication. In NSDI, 2008.

Digital Library

[19]

A. Mohaisen, A. Yun, and Y. Kim. Measuring the mixing time of social graphs. In IMC, 2010.

Digital Library

[20]

J. Newsome, E. Shi, D. Song, and A. Perrig. The Sybil attack in sensor networks: Analysis & defenses. In ACM/IEEE IPSN, 2004.

Digital Library

[21]

B. Parno, A. Perrig, and V. Gligor. Distributed detection of node replication attacks in sensor networks. In IEEE S & P, 2005.

Digital Library

[22]

C. Scheideler. How to spread adversarial nodes? Rotate! In STOC, 2005.

Digital Library

[23]

N. Tran, J. Li, L. Subramanian, and S. Chow. Optimal Sybil-resilient Node Admission Control. In INFOCOM, Apr. 2011.

[24]

N. Tran, B. Min, J. Li, and L. Subramanian. Sybil-resilient online content voting. In NSDI, 2009.

Digital Library

[25]

B. Viswanath, A. Post, K. Gummadi, and A. Mislove. An Analysis of Social Network-based Sybil Defenses. In SIGCOMM, August 2010.

Digital Library

[26]

M. Yang, Z. Zhang, X. Li, and Y. Dai. An empirical study of free-riding behavior in the Maze P2P file-sharing system. In IPTPS, 2005.

Digital Library

[27]

H. Yu, P. B. Gibbons, M. Kaminsky, and F. Xiao. SybilLimit: A Near-Optimal Social Network Defense against Sybil Attacks. Technical Report TRA2/08, National University of Singapore, School of Computing, March 2008. http://www.comp.nus.edu.sg/¿yuhf/sybillimit-tr.pdf.

Digital Library

[28]

H. Yu, P. B. Gibbons, M. Kaminsky, and F. Xiao. SybilLimit: A Near-Optimal Social Network Defense against Sybil Attacks. IEEE/ACM Transactions on Networking, June 2010. Preliminary version appeared in IEEE Symposium on Security and Privacy 2008.

Digital Library

[29]

H. Yu, P. B. Gibbons, and C. Shi. Brief Announcement: Sustaining Collaboration in Multicast despite Rational Collusion. In PODC, 2011.

Digital Library

[30]

H. Yu, M. Kaminsky, P. B. Gibbons, and A. Flaxman. SybilGuard: Defending Against Sybil Attacks via Social Networks. IEEE/ACM Transactions on Networking, June 2008. Preliminary version appeared in ACM SIGCOMM Conference 2006.

Digital Library

[31]

H. Yu, C. Shi, M. Kaminsky, P. B. Gibbons, and F. Xiao. DSybil: Optimal Sybil-Resistance for Recommendation Systems. In IEEE Symposium on Security and Privacy, May 2009.

Digital Library

Cited By

Farach-Colton GFarach-Colton MGoldberg LKomlos HLapinskas JLevi RMedina MMosteiro MLeyton-Brown KSamuelson LHartline J(2023)Graph Ranking and the Cost of Sybil DefenseProceedings of the 24th ACM Conference on Economics and Computation10.1145/3580507.3597782(586-625)Online publication date: 9-Jul-2023
https://dl.acm.org/doi/10.1145/3580507.3597782
Vakilinia IFaizian PKhalili M(2022)RewardRating: A Mechanism Design Approach to Improve Rating SystemsGames10.3390/g1304005213:4(52)Online publication date: 29-Jul-2022
https://doi.org/10.3390/g13040052
Talukder SHernandez NAzimpourkivi MCarbunar BHong JBures MPark JCerny T(2022)User awareness and defenses against sockpuppet friend invitations in FacebookProceedings of the 37th ACM/SIGAPP Symposium on Applied Computing10.1145/3477314.3507012(1740-1747)Online publication date: 25-Apr-2022
https://dl.acm.org/doi/10.1145/3477314.3507012
Show More Cited By

Index Terms

Sybil defenses via social networks: a tutorial and survey

Recommendations

An analysis of social network-based Sybil defenses
SIGCOMM '10

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 ...
Exploiting Temporal Dynamics in Sybil Defenses
CCS '15: Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security

Sybil attacks present a significant threat to many Internet systems and applications, in which a single adversary inserts multiple colluding identities in the system to compromise its security and privacy. Recent work has advocated the use of social-...
An analysis of social network-based Sybil defenses
SIGCOMM '10: Proceedings of the ACM SIGCOMM 2010 conference

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 ...

Comments

Information & Contributors

Information

Published In

cover image ACM SIGACT News

ACM SIGACT News Volume 42, Issue 3

September 2011

92 pages

ISSN:0163-5700

DOI:10.1145/2034575

Issue’s Table of Contents

Copyright © 2011 Author.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 14 October 2011

Published in SIGACT Volume 42, Issue 3

Check for updates

Qualifiers

Column

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

52
Total Citations
View Citations
863
Total Downloads

Downloads (Last 12 months)11
Downloads (Last 6 weeks)0

Reflects downloads up to 10 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Farach-Colton GFarach-Colton MGoldberg LKomlos HLapinskas JLevi RMedina MMosteiro MLeyton-Brown KSamuelson LHartline J(2023)Graph Ranking and the Cost of Sybil DefenseProceedings of the 24th ACM Conference on Economics and Computation10.1145/3580507.3597782(586-625)Online publication date: 9-Jul-2023
https://dl.acm.org/doi/10.1145/3580507.3597782
Vakilinia IFaizian PKhalili M(2022)RewardRating: A Mechanism Design Approach to Improve Rating SystemsGames10.3390/g1304005213:4(52)Online publication date: 29-Jul-2022
https://doi.org/10.3390/g13040052
Talukder SHernandez NAzimpourkivi MCarbunar BHong JBures MPark JCerny T(2022)User awareness and defenses against sockpuppet friend invitations in FacebookProceedings of the 37th ACM/SIGAPP Symposium on Applied Computing10.1145/3477314.3507012(1740-1747)Online publication date: 25-Apr-2022
https://dl.acm.org/doi/10.1145/3477314.3507012
Mauw SRamírez-Cruz YTrujillo-Rasua R(2022)Conditional adjacency anonymity in social graphs under active attacksKnowledge and Information Systems10.1007/s10115-018-1283-x61:1(485-511)Online publication date: 10-Mar-2022
https://dl.acm.org/doi/10.1007/s10115-018-1283-x
Li MZhu LLin X(2021)Privacy-Preserving Traffic Monitoring with False Report Filtering via Fog-Assisted Vehicular CrowdsensingIEEE Transactions on Services Computing10.1109/TSC.2019.290306014:6(1902-1913)Online publication date: 1-Nov-2021
https://doi.org/10.1109/TSC.2019.2903060
Roseline CAntony BBalakrishnan BChaithra CBhavyasree P(2021)Analysis of Sybil Attacks in Online Social Networks Using SyPyComputer Communication, Networking and IoT10.1007/978-981-16-0980-0_16(155-167)Online publication date: 19-Jun-2021
https://doi.org/10.1007/978-981-16-0980-0_16
Qi YXu WZhu LZhang Z(2020)Real-World Networks Are Not Always Fast MixingThe Computer Journal10.1093/comjnl/bxaa150Online publication date: 14-Dec-2020
https://doi.org/10.1093/comjnl/bxaa150
Orabi MMouheb DAl Aghbari ZKamel I(2020)Detection of Bots in Social Media: A Systematic ReviewInformation Processing & Management10.1016/j.ipm.2020.10225057:4(102250)Online publication date: Jul-2020
https://doi.org/10.1016/j.ipm.2020.102250
Gupta DSaia JYoung M(2020)Resource Burning for Permissionless Systems (Invited Paper)Structural Information and Communication Complexity10.1007/978-3-030-54921-3_2(19-44)Online publication date: 29-Jun-2020
https://dl.acm.org/doi/10.1007/978-3-030-54921-3_2
Jain RJain NNayyar A(2020)Security and Privacy in Social Networks: Data and Structural AnonymityHandbook of Computer Networks and Cyber Security10.1007/978-3-030-22277-2_11(265-293)Online publication date: 1-Jan-2020
https://doi.org/10.1007/978-3-030-22277-2_11
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents