The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Freenet: A Distributed Anonymous Information Storage and Retrieval System
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Error and attack tolerance of complex networks
Albert, R., Jeong, H., & Barabási, A.-L. (2000) · Nature · doi:10.1038/35019019 · Cited by 7,534
Error and attack tolerance of complex networks
Albert, R., Jeong, H., & Barabási, A.-Ĺ. (2000) · RePEc: Research Papers in Economics · Cited by 6,469
The small-world problem: (400002009-005)
Milgram, S. (1967) · PsycEXTRA Dataset · doi:10.1037/e400002009-005 · Cited by 4,790
Untraceable electronic mail, return addresses, and digital pseudonyms
Chaum, D. L. (1981) · Communications of the ACM · doi:10.1145/358549.358563 · Cited by 4,289
Tanenbaum, A. S. (1992) · Cited by 1,912
Chor, B., Kushilevitz, E., Goldreich, O., & Sudan, M. (1998) · Journal of the ACM · doi:10.1145/293347.293350 · Cited by 1,612
Growth dynamics of the World-Wide Web
Huberman, B. A., & Adamic, L. A. (1999) · Nature · doi:10.1038/43604 · Cited by 863
Goldschlag, D., Reed, M., & Syverson, P. (1999) · Communications of the ACM · doi:10.1145/293411.293443 · Cited by 689
Onion Routing for Anonymous and Private Internet Connections
Goldschlag, D. M., Reed, M., & Syverson, P. F. (1999) · Cited by 413
Web MIXes: A System for Anonymous and Unobservable Internet Access
Berthold, O., Federrath, H., & Köpsell, S. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44702-4_7 · Cited by 395
The Free Haven Project: Distributed Anonymous Storage Service
Dingledine, R., Freedman, M. J., & Molnar, D. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44702-4_5 · Cited by 336
Anonymous Web transactions with Crowds
Reiter, M. K., & Rubin, A. D. (1999) · Communications of the ACM · doi:10.1145/293411.293778 · Cited by 286
Publius: a robust, tamper-evident, censorship-resistant web publishing system
Waldman, M., Rubin, A. D., & Cranor, L. F. (2000) · Cited by 281
Cited by
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
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Rowstron, A., & Druschel, P. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45518-3_18 · Cited by 7,276
The Anatomy of the Grid: Enabling Scalable Virtual Organizations
Foster, I., Kesselman, C., & Tuecke, S. (2001) · The International Journal of High Performance Computing Applications · doi:10.1177/109434200101500302 · Cited by 6,547
A scalable content-addressable network
Ratnasamy, S., Francis, P., Handley, M., Karp, R., & Shenker, S. (2001) · Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/383059.383072 · Cited by 6,372
Douceur, J. R. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45748-8_24 · Cited by 4,419
“This paper shows that, without aa logically centralized authority,,Sybil attacks are always possible except under extreme andd unrealistic assumptions of resource parity andd coordinationn amongg entities.”
Background
Metadata
- Authors
- Clarke, I., Sandberg, O., Wiley, B., & Hong, T. W.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2001
- Pages
- 46-66
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W1663493649
- Cited by
- 2,109
- References
- 14
- FWCI
- 80.63
- 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.