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
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
Items 1,001–1,006 of 1,006
The challenges of existence, status, and value for improving blockchain
Lin, F., & Qiang, M. (2019) · IEEE Access · doi:10.1109/access.2018.2888697 · Cited by 22
Towards a secure ITS: Overview, challenges and solutions
Sleem, L., Noura, H. N., & Couturier, R. (2020) · Journal of Information Security and Applications · doi:10.1016/j.jisa.2020.102637 · Cited by 21
Mitigations on Sybil-Based Double-Spend Attacks in Bitcoin
Zhang, S., & Lee, J.-H. (2021) · IEEE Consumer Electronics Magazine · doi:10.1109/mce.2020.2988031 · Cited by 16
Fraud De-Anonymization for Fun and Profit
Hernandez, N., Rahman, M., Recabarren, R., & Carbunar, B. (2018) · Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3243734.3243770 · Cited by 16
Open Challenges in Multi-Agent Security: Towards Secure Systems of Interacting AI Agents
de Witt, C. S., Krawiecka, K., Krawczuk, I., Hagag, B., Anderson, W. L., Belcak, P., Bucknall, B., Cai, X., Chopra, A., Cohen, D., et al. (2025) · arXiv · doi:10.48550/arxiv.2505.02077 · Cited by 108
“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).”
Louck, Y. (2026) · arXiv · doi:10.48550/arxiv.2606.24322 · Cited by 28
“Our elevation policy is a deliberately lightweight, application-10 level answer to the Sybil attack [38].”
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
