The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
SybilGuard: Defending Against Sybil Attacks via Social Networks
Abstract
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 ldquoout voterdquo 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 ldquosocial networkrdquo 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 ldquocutrdquo 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.
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
Chord: A scalable peer-to-peer lookup service for internet applications
Stoica, I., Morris, R., Karger, D., Kaashoek, M. F., & Balakrishnan, H. (2001) · Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/383059.383071 · Cited by 9,623
Douceur, J. R. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45748-8_24 · Cited by 4,419
Chord: A scalable peer-to-peer lookup service for internet applications
Stoica, I., Morris, R., Karger, D., Kaashoek, M. F., & Balakrishnan, H. (2001) · ACM SIGCOMM Computer Communication Review · doi:10.1145/964723.383071 · Cited by 1,923
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
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
CAPTCHA: Using Hard AI Problems for Security
von Ahn, L., Blum, M., Hopper, N. J., & Langford, J. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-39200-9_18 · Cited by 1,447
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
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
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
Secure verification of location claims
Sastry, N., Shankar, U., & Wagner, D. (2003) · Proceedings of the 2nd ACM workshop on Wireless security · doi:10.1145/941311.941313 · Cited by 604
SybilLimit: A Near-Optimal Social Network Defense against Sybil Attacks
Yu, H., Gibbons, P. B., Kaminsky, M., & Xiao, F. (2008) · 2008 IEEE Symposium on Security and Privacy (sp 2008) · doi:10.1109/sp.2008.13 · Cited by 563
Self-citationRobust 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
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. (2000) · Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems · doi:10.1145/339331.339345 · Cited by 484
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
Sybil Guard: Defending Against Sybil Attacks via Social Networks
Vasudevan, S. K., Sivaraman, R., & Karthick, M. R. (2010) · International Journal of Computer Applications · doi:10.5120/896-1270 · Cited by 80
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 37
Self-citationProbabilistic 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
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
A Survey on Trust Management for Mobile Ad Hoc Networks
Cho, J.-H., Swami, A., & Chen, I.-R. (2011) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2011.092110.00088 · Cited by 664
SybilLimit: A Near-Optimal Social Network Defense against Sybil Attacks
Yu, H., Gibbons, P. B., Kaminsky, M., & Xiao, F. (2008) · 2008 IEEE Symposium on Security and Privacy (sp 2008) · doi:10.1109/sp.2008.13 · Cited by 563
Self-citationAll your contacts are belong to us: automated identity theft attacks on social networks
Bilge, L., Strufe, T., Balzarotti, D., & Kirda, E. (2009) · Proceedings of the 18th international conference on World wide web · doi:10.1145/1526709.1526784 · Cited by 545
The DARPA Twitter Bot Challenge
Subrahmanian, V. S., Azaria, A., Durst, S., Kagan, V., Galstyan, A., Lerman, K., Zhu, L., Ferrara, E., Flammini, A., & Menczer, F. (2016) · Computer · doi:10.1109/mc.2016.183 · Cited by 461
Sybil Attacks and Their Defenses in the Internet of Things
Zhang, K., Liang, X., Lu, R., & Shen, X. (2014) · IEEE Internet of Things Journal · doi:10.1109/jiot.2014.2344013 · Cited by 399
Metadata
- Authors
- Yu, H., Kaminsky, M., Gibbons, P. B., & Flaxman, A. D.
- Venue
- IEEE/ACM Transactions on Networking
- Published
- 2008-06
- Volume
- 16
- Issue
- 3
- Pages
- 576-589
- ISSN
- 1063-6692 (ISSN-L)
- OpenAlex
- W2153305401
- Cited by
- 394
- References
- 30
- FWCI
- 124.29
- Type
- journal article
- 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.