The DOI matches its Crossref record; 38 of the 38 references it cites were found in a registry or an index.
SybilLimit: A Near-Optimal Social Network Defense against Sybil Attacks
Abstract
Decentralized distributed systems such as peer-to-peer systems are particularly vulnerable to sybil attacks, where a malicious user pretends to have multiple identities (called sybil nodes). Without a trusted central authority, defending against sybil attacks is quite challenging. Among the small number of decentralized approaches, our recent SybilGuard protocol [H. Yu et al., 2006] leverages a key insight on social networks to bound the number of sybil nodes accepted. Although its direction is promising, SybilGuard can allow a large number of sybil nodes to be accepted. Furthermore, SybilGuard assumes that social networks are fast mixing, which has never been confirmed in the real world. This paper presents the novel SybilLimit protocol that leverages the same insight as SybilGuard but offers dramatically improved and near-optimal guarantees. The number of sybil nodes accepted is reduced by a factor of ominus(radicn), or around 200 times in our experiments for a million-node system. We further prove that SybilLimit's guarantee is at most a log n factor away from optimal, when considering approaches based on fast-mixing social networks. Finally, based on three large-scale real-world social networks, we provide the first evidence that real-world social networks are indeed fast mixing. This validates the fundamental assumption behind SybilLimit's and SybilGuard's approach.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Social Network Analysis: Methods and Applications
Wasserman, S., & Faust, K. (1994) · doi:10.1017/cbo9780511815478 · Cited by 17,557
Community structure in social and biological networks
Girvan, M., & Newman, M. E. J. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.122653799 · Cited by 15,502
The Byzantine generals problem
Lamport, L., Shostak, R., & Pease, M. (1982) · ACM Transactions on Programming Languages and Systems · doi:10.1145/357172.357176 · Cited by 6,023
(2017) · The SAGE Encyclopedia of Communication Research Methods · doi:10.4135/9781483381411.n575 · Cited by 6,008
Douceur, J. R. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45748-8_24 · Cited by 4,419
Measurement and analysis of online social networks
Mislove, A., Marcon, M., Gummadi, K. P., Druschel, P., & Bhattacharjee, B. (2007) · Proceedings of the 7th ACM SIGCOMM conference on Internet measurement · doi:10.1145/1298306.1298311 · Cited by 3,057
The small-world phenomenon: an algorithmic perspective
Kleinberg, J. (2000) · Proceedings of the thirty-second annual ACM symposium on Theory of computing · doi:10.1145/335305.335325 · Cited by 1,882
Group formation in large social networks: membership, growth, and evolution
Backstrom, L., Huttenlocher, D., Kleinberg, J., & Lan, X. (2006) · Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1150402.1150412 · Cited by 1,805
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Mitzenmacher, M., & Upfal, E. (2005) · Cambridge University Press eBooks · doi:10.1017/cbo9780511813603 · Cited by 1,733
The sybil attack in sensor networks: analysis & defenses
Newsome, J., Shi, E., Song, D., & Perrig, A. (2004) · Proceedings of the 3rd international symposium on Information processing in sensor networks · doi:10.1145/984622.984660 · Cited by 1,305
Lectures on the Coupling Method
Lindvall, T. (1992) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,096
Predicting Internet network distance with coordinates-based approaches
Ng, T. S. E., & Zhang, H. (2003) · Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies · doi:10.1109/infcom.2002.1019258 · Cited by 1,050
Trust Management for the Semantic Web
Richardson, M., Agrawal, R., & Domingos, P. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-39718-2_23 · Cited by 982
Telling humans and computers apart automatically
von Ahn, L., Blum, M., & Langford, J. (2004) · Communications of the ACM · doi:10.1145/966389.966390 · Cited by 895
Secure routing for structured peer-to-peer overlay networks
Castro, M., Druschel, P., Ganesh, A., Rowstron, A., & Wallach, D. S. (2002) · ACM SIGOPS Operating Systems Review · doi:10.1145/844128.844156 · Cited by 743
Distributed Detection of Node Replication Attacks in Sensor Networks
Parno, B., Perrig, A., & Gligor, V. (2005) · 2005 IEEE Symposium on Security and Privacy (S&P'05) · doi:10.1109/sp.2005.8 · Cited by 675
Robust incentive techniques for peer-to-peer networks
Feldman, M., Lai, K., Stoica, I., & Chuang, J. (2004) · Proceedings of the 5th ACM conference on Electronic commerce · doi:10.1145/988772.988788 · Cited by 558
Gossip algorithms: design, analysis and applications
Boyd, S., Ghosh, A., Prabbakar, B., & Shah, D. (2005) · Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies. · doi:10.1109/infcom.2005.1498447 · Cited by 558
Understanding the network-level behavior of spammers
Ramachandran, A., & Feamster, N. (2006) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1151659.1159947 · Cited by 510
SybilGuard: Defending Against Sybil Attacks via Social Networks
Yu, H., Kaminsky, M., Gibbons, P. B., & Flaxman, A. D. (2008) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2008.923723 · Cited by 394
Self-citationSecure routing for structured peer-to-peer overlay networks
Castro, M., Druschel, P., Ganesh, A., Rowstron, A., & Wallach, D. S. (2002) · Proceedings of the 5th symposium on Operating systems design and implementation - OSDI '02 · doi:10.1145/1060289.1060317 · Cited by 328
Sybilproof reputation mechanisms
Cheng, A., & Friedman, E. (2005) · Proceeding of the 2005 ACM SIGCOMM workshop on Economics of peer-to-peer systems - P2PECON '05 · doi:10.1145/1080192.1080202 · Cited by 269
Experience with an object reputation system for peer-to-peer filesharing
Walsh, K. S., & Sirer, E. G. (2006) · Cited by 225
The LOCKSS peer-to-peer digital preservation system
Maniatis, P., Roussopoulos, M., Giuli, T. J., Rosenthal, D. S. H., & Baker, M. (2005) · ACM Transactions on Computer Systems · doi:10.1145/1047915.1047917 · Cited by 208
Danezis, G., Lesniewski-Laas, C., Kaashoek, M. F., & Anderson, R. (2005) · Lecture Notes in Computer Science · doi:10.1007/11555827_18 · Cited by 165
Ostra: Leveraging trust to thwart unwanted communication
Mislove, A. E., Post, A., Druschel, P., & Gummadi, K. P. (2008) · Cited by 153
An Empirical Study of Collusion Behavior in the Maze P2P File-Sharing System
Lian, Q., Zhang, Z., Yang, M., Zhao, B. Y., Dai, Y., & Li, X. (2007) · Proceedings of the ... International Conference on Distributed Computing Systems/Proceedings of the International Conference on Distributed Computing Systems · doi:10.1109/icdcs.2007.84 · Cited by 152
Steiner, M., En-Najjary, T., & Biersack, E. W. (2007) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1290168.1290176 · Cited by 121
Bar-Yossef, Z., Kumar, R., & Sivakumar, D. (2001) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/380752.380810 · Cited by 111
An Empirical Study of Free-Riding Behavior in the Maze P2P File-Sharing System
Yang, M., Zhang, Z., Li, X., & Dai, Y. (2005) · Lecture notes in computer science · doi:10.1007/11558989_17 · Cited by 90
On the establishment of distinct identities in overlay networks
Bazzi, R. A., & Konjevod, G. (2005) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/1073814.1073873 · Cited by 75
Efficient lookup on unstructured topologies
Morselli, R., Bhattacharjee, B., Srinivasan, A., & Marsh, M. A. (2005) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/1073814.1073828 · Cited by 63
Expansion and Lack Thereof in Randomly Perturbed Graphs
Flaxman, A. D. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-78808-9_3 · Cited by 37
Informant: Detecting Sybils Using Incentives
Margolin, N. B., & Levine, B. N. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-77366-5_18 · Cited by 36
Probabilistic Quorums for Dynamic Systems
Abraham, I., & Malkhi, D. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-39989-6_5 · Cited by 34
Expansion and Lack Thereof in Randomly Perturbed Graphs
Flaxman, A. D. (2007) · Internet Mathematics · doi:10.1080/15427951.2007.10129290 · Cited by 26
Toward an optimal social network defense against Sybil attacks
Yu, H., Gibbons, P. B., & Kaminsky, M. (2007) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/1281100.1281181 · Cited by 19
Self-citationEfficient lookup on unstructured topologies
Morselli, R., Bhattacharjee, B., Marsh, M. A., & Srinivasan, A. (2007) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2007.07007 · Cited by 18
Cited by
On the evolution of user interaction in facebook
Viswanath, B., Mislove, A., Cha, M., & Gummadi, K. P. (2009) · Proceedings of the 2nd ACM workshop on Online social networks · doi:10.1145/1592665.1592675 · Cited by 1,461
De-anonymizing Social Networks
Narayanan, A., & Shmatikov, V. (2009) · 2009 30th IEEE Symposium on Security and Privacy · doi:10.1109/sp.2009.22 · Cited by 1,301
User interactions in social networks and their implications
Wilson, C., Boe, B., Sala, A., Puttaswamy, K. P. N., & Zhao, B. Y. (2009) · Proceedings of the 4th ACM European conference on Computer systems · doi:10.1145/1519065.1519089 · Cited by 879
A survey of attack and defense techniques for reputation systems
Hoffman, K., Zage, D., & Nita-Rotaru, C. (2009) · ACM Computing Surveys · doi:10.1145/1592451.1592452 · Cited by 777
Towards secure industrial IoT: blockchain system with credit-based consensus mechanism
Huang, J., Kong, L., Chen, G., Wu, M.-Y., Liu, X., & Zeng, P. (2019) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2019.2903342 · Cited by 563
Metadata
- Authors
- Yu, H., Gibbons, P. B., Kaminsky, M., & Xiao, F.
- Venue
- 2008 IEEE Symposium on Security and Privacy (sp 2008)
- Publisher
- IEEE
- Published
- 2008-05
- Pages
- 3-17
- ISSN
- 1081-6011 (ISSN-L)
- OpenAlex
- W2150941206
- Cited by
- 563
- References
- 38
- FWCI
- 33.05
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.