The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
SybilGuard: defending against sybil attacks via social networks
Open accessAbstract
Peer-to-peer and other decentralized,distributed systems are known to be particularly vulnerable to sybil attacks. In a sybil attack,a malicious user obtains multiple fake identities and pretends to be multiple, distinct nodes in the system. By controlling a large fraction of the nodes in the system,the malicious user is able to "out vote" the honest users in collaborative tasks such as Byzantine failure defenses. This paper presents SybilGuard, a novel protocol for limiting the corruptive influences of sybil attacks.Our protocol is based on the "social network "among user identities, where an edge between two identities indicates a human-established trust relationship. Malicious users can create many identities but few trust relationships. Thus, there is a disproportionately-small "cut" in the graph between the sybil nodes and the honest nodes. SybilGuard exploits this property to bound the number of identities a malicious user can create.We show the effectiveness of SybilGuard both analytically and experimentally.
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.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Prior work has focused quite extensively on the analysis and the detection of sybil and/or fake accounts in online social networks by relying on tightly-knit community structures [54, 15, 53, 9, 52, 5].”
From Measuring, Characterizing, and Detecting Facebook Like Farms (2017) · cites this paper as [54]
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
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060
Stoica, I. G., Morris, R., Karger, D. R., Kaashoek, M. F., & Balakrishnan, H. (2001) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/383059.383071 · Cited by 9,622
Kleinberg, J. M. (2000) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/335305.335325 · Cited by 1,905
The sybil attack in sensor networks
Newsome, J., Shi, E., Song, D. X., & Perrig, A. (2004) · ACM/IEEE International Conference on Information Processing in Sensor Networks (IPSN) · doi:10.1145/984622.984660 · Cited by 1,298
Predicting Internet network distance with coordinates-based approaches
Ng, T. S. E., & Zhang, H. (2003) · Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM) · doi:10.1109/infcom.2002.1019258 · Cited by 1,056
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 1,002
Distributed Detection of Node Replication Attacks in Sensor Networks
Parno, B. J., Perrig, A., & Gligor, V. D. (2005) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp.2005.8 · Cited by 684
Secure verification of location claims
Sastry, N., Shankar, U., & Wagner, D. A. (2003) · doi:10.1145/941311.941313 · Cited by 605
Gossip algorithms: design, analysis and applications
Boyd, S., Ghosh, A., Prabbakar, B., & Shah, D. (2005) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2005.1498447 · Cited by 559
Robust incentive techniques for peer-to-peer networks
Feldman, M., Lai, K., Stoica, I. G., & Chuang, J. C.-I. (2004) · ACM Conference on Electronic Commerce (EC) · doi:10.1145/988772.988788 · Cited by 552
Feasibility of a serverless distributed file system deployed on an existing set of desktop PCs
Bolosky, W. J., Douceur, J. R., Ely, D., & Theimer, M. M. (2000) · ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS) · doi:10.1145/339331.339345 · Cited by 486
Sybilproof reputation mechanisms
Cheng, A., & Friedman, E. (2005) · doi:10.1145/1080192.1080202 · Cited by 270
Understanding the network-level behavior of spammers
Ramachandran, A., & Feamster, N. (2006) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/1159913.1159947 · Cited by 243
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. G. (2005) · ACM Transactions on Computer Systems · doi:10.1145/1047915.1047917 · Cited by 206
Danezis, G., Lesniewski-Laas, C., Kaashoek, M. F., & Anderson, R. (2005) · Lecture notes in computer science · doi:10.1007/11555827_18 · Cited by 162
Worm Origin Identification Using Random Moonwalks
Xie, Y., Sekar, V., Maltz, D. A., Reiter, M. K., & Zhang, H. (2005) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp.2005.23 · Cited by 102
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
Probabilistic quorums for dynamic systems
Abraham, I., & Malkhi, D. (2005) · Distributed Computing · doi:10.1007/s00446-005-0139-2 · Cited by 39
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 36
Self-citation
Research works printed but not linked: 3
Cited by
Sorted by citations
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
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
Atzori, L., Iera, A., Morabito, G., & Nitti, M. (2012) · Computer Networks · doi:10.1016/j.comnet.2012.07.010 · Cited by 1,238
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. J., Zage, D., & Nita-Rotaru, C. (2009) · ACM Computing Surveys · doi:10.1145/1592451.1592452 · Cited by 774
Metadata
- Authors
- Yu, H., Kaminsky, M., Gibbons, P. B., & Flaxman, A.
- Affiliations
- Intel (United States) (US)
- Carnegie Mellon University (US)
- Venue
- Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
- Publisher
- ACM
- Published
- 2006-08-11
- Pages
- 267-278
- OpenAlex
- W4240443285
- Cited by
- 260
- References
- 21
- Citations by year
- 2026: 7 · 2025: 4 · 2024: 10 · 2023: 8 · 2022: 4 · 2021: 9 · 2020: 8 · 2019: 7 · 2018: 14 · 2017: 12 · 2016: 18 · 2015: 16 · 2014: 20 · 2013: 14 · 2012: 21
- FWCI
- 32.14
- Type
- conference paper
- Language
- en
- Open access
- bronze
- doi.org
- Locations
- ACM SIGCOMM Conference (SIGCOMM) (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › Access Control and Trust
- Physical Sciences › Computer Science › Computer Networks and Communications › Peer-to-Peer Network Technologies
- Physical Sciences › Computer Science › Information Systems › Spam and Phishing Detection
- Keywords
- Sybil attack, peer-to-peer networks, decentralized systems, trust relationships, social networks, graph cuts, Byzantine fault tolerance, identity spoofing, malicious node detection
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
