The DOI matches its Crossref record; 39 of the 41 references it cites were found in a registry or an index.
The Sybil Attack
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
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
“Attackers use these forged identities to control or affect other normal nodes in a distributed network, resulting in network robustness losses (Douceur 2002;Singh and (2006) Eclipse attacks on overlay networks: Threats and defenses.In: Proceedings IEEE INFOCOM 2006;).”
From Survey: federated learning data security and privacy-preserving in edge-Internet of Things (2024) · cites this paper as Douceur 2002
In the citing paper
“By forming de facto coalitions that dominate voting rights or resource allocation, exploitative agents skew incentives, stall consensus, and ultimately erode the trust essential for robust, large-scale cooperation (Douceur, 2002).”
From Open Challenges in Multi-Agent Security: Towards Secure Systems of Interacting AI Agents (2025) · cites this paper as Douceur, 2002
In the citing paper
“The transaction throughput of PBFT is better compared to that of PoW [127].”
From A Review of Blockchain Architecture and Consensus Protocols: Use Cases, Challenges, and Solutions (2019) · cites this paper as [127]
In the citing paper
“Due to this reason, such a kind of IIoT nodes commonly route their data through gateways by using non-P2P protocols like MQTT [30] or by making use of a fog [31] or edge computing infrastructure [32].”
From A Review on the Application of Blockchain to the Next Generation of Cybersecure Industry 4.0 Smart Factories (2019) · cites this paper as [30]
Citations
Cites
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
Life on the Screen: Identity in the Age of the Internet
Turkle, S. (1997) · Cited by 6,340
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
Bellare, M., & Rogaway, P. (1993) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/168588.168596 · Cited by 4,695
Untraceable electronic mail, return addresses, and digital pseudonyms
Chaum, D. (1981) · Communications of the ACM · doi:10.1145/358549.358563 · Cited by 4,299
Practical Byzantine fault tolerance
Castro, M., & Liskov, B. H. (1999) · Operating Systems Design and Implementation · doi:10.5555/296806.296824 · Cited by 4,026
How To Prove Yourself: Practical Solutions to Identification and Signature Problems
Fiat, A., & Adi Shamir, Z. (2007) · Springer eBooks · doi:10.1007/3-540-47721-7_12 · Cited by 3,972
Freenet: A Distributed Anonymous Information Storage and Retrieval System
Clarke, I., Sandberg, O. J., Wiley, B., & Hong, T. W. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44702-4_4 · Cited by 2,125
Reiter, M. K., & Rubin, A. D. (1998) · ACM Transactions on Information and System Security · doi:10.1145/290163.290168 · Cited by 1,757
Wide-area cooperative storage with CFS
Dabek, F., Kaashoek, M. F., Karger, D. R., Morris, R., & Stoica, I. G. (2001) · doi:10.1145/502034.502054 · Cited by 1,523
Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility
Rowstron, A. I. T., & Druschel, P. (2001) · doi:10.1145/502034.502053 · Cited by 1,223
Identity and deception in the virtual community
Donath, J. (2002) · Routledge eBooks · doi:10.4324/9780203194959-11 · Cited by 1,177
Chor, B., Goldreich, O., Eyal Kushilevitz, Z., & Sudan, M. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1995.492461 · Cited by 1,116
(2001) · Cited by 1,052
Zero-knowledge proofs of identity
Feige, U., Fiat, A., & Adi Shamir, Z. (1988) · Journal of Cryptology · doi:10.1007/bf02351717 · Cited by 1,033
Secure communications over insecure channels
Merkle, R. C. (1978) · Communications of the ACM · doi:10.1145/359460.359473 · Cited by 757
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
Self-citationPrivacy Extensions for Stateless Address Autoconfiguration in IPv6
Narten, T., Draves, R., & Krishnan, S. (2007) · doi:10.17487/rfc4941 · Cited by 387
DOS-Resistant Authentication with Client Puzzles
Aura, T. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44810-1_23 · Cited by 380
The Free Haven Project: Distributed Anonymous Storage Service
Dingledine, R., Freedman, M. J., & Molnár, D. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44702-4_5 · Cited by 336
Separating key management from file system security
Mazières, D., Kaminsky, M., Kaashoek, M. F., & Witchel, E. (1999) · doi:10.1145/319151.319160 · Cited by 328
Publius: a robust, tamper-evident, censorship-resistant web publishing system
Waldman, M., Rubin, A. D., & Cranor, L. F. (2000) · Cited by 281
Using client puzzles to protect TLS
Dean, D., & Stubblefield, A. (2001) · USENIX Security Symposium · Cited by 222
Survivable information storage systems
Wylie, J. J., Bigrigg, M. W., Strunk, J. D., Ganger, G. R., Kiliççöte, H., & Khosla, P. K. (2000) · Computer · doi:10.1109/2.863969 · Cited by 215
DOS-Resistant Authentication with Client Puzzles
Aura, T., Nikander, P., & Leiwo, J. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44810-1_22 · Cited by 180
Doyle, J. F. (2001) · Ubiquity · doi:10.1145/375348.377427 · Cited by 179
Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility
Rowstron, A. I. T., & Druschel, P. (2001) · ACM SIGOPS Operating Systems Review · doi:10.1145/502059.502053 · Cited by 154
Privacy Extensions for Stateless Address Autoconfiguration in IPv6
Narten, T., & Draves, R. (2001) · doi:10.17487/rfc3041 · Cited by 136
Wide-area cooperative storage with CFS
Dabek, F., Kaashoek, M. F., Karger, D. R., Morris, R., & Stoica, I. G. (2001) · ACM SIGOPS Operating Systems Review · doi:10.1145/502059.502054 · Cited by 122
An Efficient Identification Scheme Based on Permuted Kernels (extended abstract)
Shamir, A. (2007) · Springer eBooks · doi:10.1007/0-387-34805-0_54 · Cited by 110
Towards an archival Intermemory
Goldberg, A. V., & Yianilos, P. N. (2002) · doi:10.1109/adl.1998.670389 · Cited by 108
A Modification of the Fiat-Shamir Scheme
Ohta, K., & Okamoto, T. (1990) · Lecture notes in computer science · doi:10.1007/0-387-34799-2_17 · Cited by 100
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 Performance Evaluation Review · doi:10.1145/345063.339345 · Cited by 83
Self-citationThe Swarm scalable storage system
Hartman, J. H., Murdock, I., & Spalink, T. (2003) · IEEE International Conference on Distributed Computing Systems (ICDCS) · doi:10.1109/icdcs.1999.776508 · Cited by 71
Establishing identity without certification authorities
Ellison, C. M. (1996) · Cited by 65
A Random Server Model for Private Information Retrieval
Gertner, Y., Goldwasser, S., & Malkin, T. (1998) · Lecture notes in computer science · doi:10.1007/3-540-49543-6_17 · Cited by 57
Privacy Extensions for Stateless Address Autoconfiguration in IPv6 Status of this Memo
Narten, T., & Draves, R. (2001) · Cited by 53
Gertner, Y., Goldwasser, S., & Malkin, T. (1998) · Cited by 47
Separating key management from file system security
Mazières, D., Kaminsky, M., Kaashoek, M. F., & Witchel, E. (1999) · ACM SIGOPS Operating Systems Review · doi:10.1145/319344.319160 · Cited by 33
Flagged first, then by citations
2 of the 41 references couldn’t be matched to a known paper.
Research works printed but not linked: 1
- A. Juels, J. Brainard, “Client Puzzles: A Cryptographic Defense against Connection Depletion Attacks”, NDSS’ 99, ISOC, 1999, pp. 151–165.
Cited by
Sorted by citations
Advances and Open Problems in Federated Learning
Kairouz, P., & McMahan, H. B. (2021) · Foundations and Trends in Machine Learning · doi:10.1561/2200000083 · Cited by 7,772
“An actively malicious adversary controlling the server could simulate a large number of fake client devices (a “Sybil attack” [140]) or could preferentially select previously compromised devices from the pool of available devices.”
BackgroundBlockchains and smart contracts for the internet of things
Christidis, K., & Devetsikiotis, M. (2016) · IEEE Access · doi:10.1109/access.2016.2566339 · Cited by 4,552
Tor: The Second-Generation Onion Router
Dingledine, R., Mathewson, N., & Syverson, P. (2004) · doi:10.21236/ada465464 · Cited by 4,104
The EigenTrust algorithm for reputation management in P2P networks
Kamvar, S. D., Schlosser, M. T., & Garcia-Molina, H. (2003) · Proceedings of the twelfth international conference on World Wide Web - WWW '03 · doi:10.1145/775152.775242 · Cited by 3,362
Secure routing in wireless sensor networks: attacks and countermeasures
Karlof, C., & Wagner, D. A. (2003) · Ad Hoc Networks · doi:10.1016/s1570-8705(03)00008-8 · Cited by 2,941
Metadata
- Authors
- Douceur, J. R.
- Affiliations
- Microsoft (United States) (US)
- Corresponding author
- Douceur, John R.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2002
- Pages
- 251-260
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W1520914943
- Cited by
- 4,419
- References
- 41
- Citations by year
- 2026: 82 · 2025: 111 · 2024: 121 · 2023: 126 · 2022: 147 · 2021: 208 · 2020: 229 · 2019: 204 · 2018: 191 · 2017: 155 · 2016: 168 · 2015: 195 · 2014: 242 · 2013: 240 · 2012: 269
- FWCI
- 49.05
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- Lecture notes in computer science (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › Peer-to-Peer Network Technologies
- Physical Sciences › Computer Science › Computer Networks and Communications › Advanced Authentication Protocols Security
- Physical Sciences › Computer Science › Computer Networks and Communications › Access Control and Trust
- Keywords
- Sybil attack, peer-to-peer networks, identity control, redundancy, decentralized identity management, system security
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
