Abstract
We describe Freenet, an adaptive peer-to-peer network application that permits the publication, replication, and retrieval of data while protecting the anonymity of both authors and readers. Freenet operates as a network of identical nodes that collectively pool their storage space to store data files and cooperate to route requests to the most likely physical location of data. No broadcast search or centralized location index is employed. Files are referred to in a location-independent manner, and are dynamically replicated in locations near requestors and deleted from locations where there is no interest. It is infeasible to discover the true origin or destination of a file passing through the network, and dificult for a node operator to determine or be held responsible for the actual physical contents of her own node.
Work of Theodore W. Hong was supported by grants from the Marshall Aid Commemoration Commission and the National Science Foundation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
S. Adler, “The Slashdot effect: an analysis of three Internet publications,” Linux Gazette issue 38, March 1999.
R. Albert, H. Jeong, and A. Barabási, “Error and attack tolerance of complex networks,” Nature 406, 378–382 (2000).
American National Standards Institute, American National Standard X9.30.2-1997: Public Key Cryptography for the Financial Services Industry-Part 2: The Secure Hash Algorithm (SHA-1) (1997).
R. J. Anderson, “The Eternity service,” in Proceedings of the 1st International Conference on the Theory and Applications of Cryptology (PRAGOCRYPT’ 96), Prague, Czech Republic (1996).
O. Berthold, H. Federrath, and S. Köpsell, “Web MIXes: a system for anonymous and unobservable Internet access,” in Proceedings of the Workshop on Design Issues in Anonymity and Unobservability, Berkeley, CA, USA. Springer: New York (2001).
D. L. Chaum, “Untraceable electronic mail, return addresses, and digital pseudonyms,” Communications of the ACM 24(2), 84–88(1981).
Y. Chen, J. Edler, A. Goldberg, A. Gottlieb, S. Sobti, and P. Yianilos, “A proto-type implementation of archival intermemory,” in Proceedings of the Fourth ACM Conference on Digital Libraries (DL’ 99), Berkeley, CA, USA. ACM Press: New York (1999).
B. Chor, O. Goldreich, E. Kushilevitz, and M. Sudan, “Private information retrieval,” Journal of the ACM 45(6), 965–982 (1998).
I. Clarke, “A distributed decentralised information storage and retrieval system,” unpublished report, Division of Informatics, University of Edinburgh (1999). Available at http://www.freenetproject.org/ (2000).
L. Cottrell, “Frequently asked questions about Mixmaster remailers,” http://www.obscura.com/~loki/remailer/mixmaster-faq.html (2000).
R. Dingledine, M. J. Freedman, and D. Molnar, “The Free Haven project: distributed anonymous storage service,” in Proceedings of the Workshop on Design Issues in Anonymity and Unobservability, Berkeley, CA, USA. Springer: New York(2001).
D. J. Ellard, J. M. Megquier, and L. Park, “The INDIA protocol,” http://www.eecs.harvard.edu/~ellard/India-WWW/ (2000).
I. Goldberg and D. Wagner, “TAZ servers and the rewebber network: enabling anonymous publishing on the world wide web,” First Monday 3(4) (1998).
D. Goldschlag, M. Reed, and P. Syverson, “Onion routing for anonymous and private Internet connections,” Communications of the ACM 42(2), 39–41 (1999).
T. Hong, “Performance,” in Peer-to-Peer, ed. by A. Oram. O’Reilly: Sebastopol, CA, USA (2001).
B. A. Huberman and L. A. Adamic, “Internet: growth dynamics of the world-wide web,” Nature 401, 131 (1999).
S. Milgram, “The small world problem,” Psychology Today 1(1), 60–67 (1967).
M. K. Reiter and A. D. Rubin, “Anonymous web transactions with Crowds,” Communications of the ACM 42(2), 32–38 (1999).
M. Richtel and S. Robinson, “Several web sites are attacked on day after assault shut Yahoo,” The New York Times, February 9, 2000.
J. Rosen, “The eroded self,” The New York Times, April 30, 2000.
A. S. Tanenbaum, Modern Operating Systems. Prentice-Hall: Upper Saddle River, NJ, USA (1992).
M. Waldman, A. D. Rubin, and L. F. Cranor, “Publius: a robust, tamper-evident, censorship-resistant, web publishing system,” in Proceedings of the Ninth USENIX Security Symposium, Denver, CO, USA (2000).
D. Watts and S. Strogatz, “Collective dynamics of’ small-world’ networks,” Nature 393, 440–442 (1998).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Clarke, I., Sandberg, O., Wiley, B., Hong, T.W. (2001). Freenet: A Distributed Anonymous Information Storage and Retrieval System. In: Federrath, H. (eds) Designing Privacy Enhancing Technologies. Lecture Notes in Computer Science, vol 2009. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44702-4_4
Download citation
DOI: https://doi.org/10.1007/3-540-44702-4_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41724-8
Online ISBN: 978-3-540-44702-3
eBook Packages: Springer Book Archive