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
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.”
BackgroundJacobson, V., Smetters, D. K., Thornton, J. D., Plass, M. F., Briggs, N. H., & Braynard, R. L. (2009) · Proceedings of the 5th international conference on Emerging networking experiments and technologies · doi:10.1145/1658939.1658941 · Cited by 4,031
Chord: a scalable peer-to-peer lookup protocol for internet applications
Stoica, I., Morris, R., Liben-Nowell, D., Karger, D. R., Kaashoek, M. F., Dabek, F., & Balakrishnan, H. (2003) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2002.808407 · Cited by 3,133
Measurement study of peer-to-peer file sharing systems:
Saroiu, S., Gummadi, P. K., & Gribble, S. D. (2001) · SPIE Proceedings · doi:10.1117/12.449977 · Cited by 1,905
A scalable content-addressable network
Ratnasamy, S., Francis, P., Handley, M., Karp, R., & Shenker, S. (2001) · ACM SIGCOMM Computer Communication Review · doi:10.1145/964723.383072 · Cited by 1,799
Tapestry: A Resilient Global-Scale Overlay for Service Deployment
Zhao, B. Y., Huang, L., Stribling, J., Rhea, S. C., Joseph, A. D., & Kubiatowicz, J. D. (2004) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2003.818784 · Cited by 1,730
A survey and comparison of peer-to-peer overlay network schemes
Lua, E. K., Crowcroft, J., Pias, M., Sharma, R., & Lim, S. (2005) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2005.1610546 · Cited by 1,496
Gossip-based computation of aggregate information
Kempe, D., Dobra, A., & Gehrke, J. (2004) · 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings. · doi:10.1109/sfcs.2003.1238221 · Cited by 1,480
Wide-area cooperative storage with CFS
Dabek, F., Kaashoek, M. F., Karger, D., Morris, R., & Stoica, I. (2001) · Proceedings of the eighteenth ACM symposium on Operating systems principles · doi:10.1145/502034.502054 · Cited by 1,428
A survey of peer-to-peer content distribution technologies
Androutsellis-Theotokis, S., & Spinellis, D. (2004) · ACM Computing Surveys · doi:10.1145/1041680.1041681 · Cited by 1,425
Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility
Rowstron, A., & Druschel, P. (2001) · Proceedings of the eighteenth ACM symposium on Operating systems principles · doi:10.1145/502034.502053 · Cited by 1,218
Scalable and efficient provable data possession
Ateniese, G., Di Pietro, R., Mancini, L. V., & Tsudik, G. (2008) · Proceedings of the 4th international conference on Security and privacy in communication netowrks · doi:10.1145/1460877.1460889 · Cited by 1,129
Community, joining, and specialization in open source software innovation: a case study
von Krogh, G., Spaeth, S., & Lakhani, K. R. (2003) · Research Policy · doi:10.1016/s0048-7333(03)00050-7 · Cited by 1,025
Value-based requirements engineering: exploring innovative e-commerce ideas
Akkermans, J. M., & Gordijn, J. (2003) · Requirements Engineering · doi:10.1007/s00766-003-0169-x · Cited by 876
Farsite: federated, available, and reliable storage for an incompletely trusted environment
Adya, A., Bolosky, W. J., Castro, M., Cermak, G., Chaiken, R., Douceur, J. R., Howell, J., Lorch, J. R., Theimer, M., & Wattenhofer, R. P. (2002) · ACM SIGOPS Operating Systems Review · doi:10.1145/844128.844130 · Cited by 780
Secure routing for structured peer-to-peer overlay networks
Castro, M., Druschel, P., Ganesh, A., Rowstron, A., & Wallach, D. S. (2002) · ACM SIGOPS Operating Systems Review · doi:10.1145/844128.844156 · Cited by 743
Tarzan: a peer-to-peer anonymizing network layer
Freedman, M. J., & Morris, R. (2002) · Proceedings of the 9th ACM conference on Computer and communications security · doi:10.1145/586110.586137 · Cited by 663
Reclaiming space from duplicate files in a serverless distributed file system
Douceur, J. R., Adya, A., Bolosky, W. J., Simon, P., & Theimer, M. (2003) · Proceedings 22nd International Conference on Distributed Computing Systems · doi:10.1109/icdcs.2002.1022312 · Cited by 645
Analysis of the Blockchain Protocol in Asynchronous Networks
Pass, R., Seeman, L., & Shelat, A. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-56614-6_22 · Cited by 613
Analyzing Peer-To-Peer Traffic Across Large Networks
Sen, S., & Wang, J. (2004) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2004.826277 · Cited by 586
Rodrigues, R., & Druschel, P. (2010) · Communications of the ACM · doi:10.1145/1831407.1831427 · Cited by 562
An analysis of Internet content delivery systems
Saroiu, S., Gummadi, K. P., Dunn, R. J., Gribble, S. D., & Levy, H. M. (2002) · ACM SIGOPS Operating Systems Review · doi:10.1145/844128.844158 · Cited by 546
Looking up data in P2P systems
Balakrishnan, H., Kaashoek, M. F., Karger, D., Morris, R., & Stoica, I. (2003) · Communications of the ACM · doi:10.1145/606272.606299 · Cited by 546
On Death, Taxes, and the Convergence of Peer-to-Peer and Grid Computing
Foster, I., & Iamnitchi, A. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45172-3_11 · Cited by 504
A survey on essential components of a self-sovereign identity
Mühle, A., Grüner, A., Gayvoronskaya, T., & Meinel, C. (2018) · Computer Science Review · doi:10.1016/j.cosrev.2018.10.002 · Cited by 483
Safebook: A privacy-preserving online social network leveraging on real-life trust
Cutillo, L. A., Molva, R., & Strufe, T. (2009) · IEEE Communications Magazine · doi:10.1109/mcom.2009.5350374 · Cited by 456
Protecting free expression online with Freenet
Clarke, I., Miller, S. G., Hong, T. W., Sandberg, O., & Wiley, B. (2002) · IEEE Internet Computing · doi:10.1109/4236.978368 · Cited by 401
Self-citationMulti-dimensional range queries in sensor networks
Li, X., Kim, Y. J., Govindan, R., & Hong, W. (2003) · Proceedings of the 1st international conference on Embedded networked sensor systems · doi:10.1145/958491.958500 · Cited by 387
Survey of research towards robust peer-to-peer networks: Search methods
Risson, J., & Moors, T. (2006) · Computer Networks · doi:10.1016/j.comnet.2006.02.001 · Cited by 386
Measuring and analyzing the characteristics of Napster and Gnutella hosts
Saroiu, S., Gummadi, K. P., & Gribble, S. D. (2003) · Multimedia Systems · doi:10.1007/s00530-003-0088-1 · Cited by 383
Small-World Phenomena and the Dynamics of Information
Kleinberg, J. (2002) · Advances in Neural Information Processing Systems 14 · doi:10.7551/mitpress/1120.003.0060 · Cited by 382
Query-based sampling of text databases
Callan, J., & Connell, M. (2001) · ACM Transactions on Information Systems · doi:10.1145/382979.383040 · Cited by 368
Caching in information centric networking: A survey
Zhang, G., Li, Y., & Lin, T. (2013) · Computer Networks · doi:10.1016/j.comnet.2013.07.007 · Cited by 358
A taxonomy of Data Grids for distributed data sharing, management, and processing
Venugopal, S., Buyya, R., & Ramamohanarao, K. (2006) · ACM Computing Surveys · doi:10.1145/1132952.1132955 · Cited by 351
Ivy: a read/write peer-to-peer file system
Muthitacharoen, A., Morris, R., Gil, T. M., & Chen, B. (2002) · ACM SIGOPS Operating Systems Review · doi:10.1145/844128.844132 · Cited by 351
Choosing reputable servents in a P2P network
Cornelli, F., Damiani, E., di Vimercati, S. D. C., Paraboschi, S., & Samarati, P. (2002) · Proceedings of the 11th international conference on World Wide Web · doi:10.1145/511446.511496 · Cited by 349
Anthill: a framework for the development of agent-based peer-to-peer systems
Babaoglu, O., Meling, H., & Montresor, A. (2003) · Proceedings 22nd International Conference on Distributed Computing Systems · doi:10.1109/icdcs.2002.1022238 · Cited by 337
Distributed and cloud computing: from parallel processing to the Internet of things
(2012) · Choice Reviews Online · doi:10.5860/choice.49-5712 · Cited by 314
Low-resource routing attacks against tor
Bauer, K., McCoy, D., Grunwald, D., Kohno, T., & Sicker, D. (2007) · Proceedings of the 2007 ACM workshop on Privacy in electronic society · doi:10.1145/1314333.1314336 · Cited by 314
NOYB: privacy in online social networks
Guha, S., Tang, K., & Francis, P. (2008) · Proceedings of the first workshop on Online social networks · doi:10.1145/1397735.1397747 · Cited by 300
Achieving Efficient Conjunctive Keyword Searches over Encrypted Data
Ballard, L., Kamara, S., & Monrose, F. (2005) · Lecture Notes in Computer Science · doi:10.1007/11602897_35 · Cited by 299
Analyzing peer-to-peer traffic across large networks
Sen, S., & Wang, J. (2002) · Proceedings of the second ACM SIGCOMM Workshop on Internet measurment - IMW '02 · doi:10.1145/637201.637222 · Cited by 290
Storer, M. W., Greenan, K., Long, D. D. E., & Miller, E. L. (2008) · Proceedings of the 4th ACM international workshop on Storage security and survivability · doi:10.1145/1456469.1456471 · Cited by 288
TrustMe: anonymous management of trust relationships in decentralized P2P systems
Singh, A., & Liu, L. (2003) · Proceedings Third International Conference on Peer-to-Peer Computing (P2P2003) · doi:10.1109/ptp.2003.1231514 · Cited by 287
Complex networks and decentralized search algorithms
Kleinberg, J. (2007) · Proceedings of the International Congress of Mathematicians Madrid, August 22–30, 2006 · doi:10.4171/022-3/50 · Cited by 272
A survey on content-centric technologies for the current Internet: CDN and P2P solutions
Passarella, A. (2012) · Computer Communications · doi:10.1016/j.comcom.2011.10.005 · Cited by 226
“A similar approach (although less elaborated) is also used in FreeNet [225].”
MethodDecentralized provenance-aware publishing with nanopublications
Kuhn, T., Chichester, C., Krauthammer, M., Queralt-Rosinach, N., Verborgh, R., Giannakopoulos, G., Ngonga Ngomo, A.-C., Viglianti, R., & Dumontier, M. (2016) · PeerJ Computer Science · doi:10.7717/peerj-cs.78 · Cited by 90
Self-Adapting Reliability in Distributed Software Systems
Brun, Y., Bang, J. Y., Edwards, G., & Medvidovic, N. (2015) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2015.2412134 · Cited by 16
“Iterative redundancy self-adapts in three ways: (1) by automatically detecting when the resource reliability drops, (2) by identifying unlucky parts of the computation that happen to deploy on disproportionately many compromised resources, and (3) by not relying on a priori estimates of resource…”
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.