Freenet: A Distributed Anonymous Information Storage and Retrieval System

  • Ian Clarke
  • Oskar Sandberg
  • Brandon Wiley
  • Theodore W. Hong
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2009)


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.


Malicious Node Remote Node Node Operator Dictionary Attack Private Information Retrieval 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    S. Adler, “The Slashdot effect: an analysis of three Internet publications,” Linux Gazette issue 38, March 1999.Google Scholar
  2. 3.
    R. Albert, H. Jeong, and A. Barabási, “Error and attack tolerance of complex networks,” Nature 406, 378–382 (2000).CrossRefGoogle Scholar
  3. 4.
    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).Google Scholar
  4. 5.
    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).Google Scholar
  5. 7.
    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).Google Scholar
  6. 8.
    D. L. Chaum, “Untraceable electronic mail, return addresses, and digital pseudonyms,” Communications of the ACM 24(2), 84–88(1981).CrossRefGoogle Scholar
  7. 9.
    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).Google Scholar
  8. 10.
    B. Chor, O. Goldreich, E. Kushilevitz, and M. Sudan, “Private information retrieval,” Journal of the ACM 45(6), 965–982 (1998).zbMATHCrossRefMathSciNetGoogle Scholar
  9. 12.
    I. Clarke, “A distributed decentralised information storage and retrieval system,” unpublished report, Division of Informatics, University of Edinburgh (1999). Available at (2000).
  10. 13.
    L. Cottrell, “Frequently asked questions about Mixmaster remailers,” (2000).
  11. 14.
    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).Google Scholar
  12. 16.
    D. J. Ellard, J. M. Megquier, and L. Park, “The INDIA protocol,” (2000).
  13. 18.
    I. Goldberg and D. Wagner, “TAZ servers and the rewebber network: enabling anonymous publishing on the world wide web,” First Monday 3(4) (1998).Google Scholar
  14. 19.
    D. Goldschlag, M. Reed, and P. Syverson, “Onion routing for anonymous and private Internet connections,” Communications of the ACM 42(2), 39–41 (1999).CrossRefGoogle Scholar
  15. 21.
    T. Hong, “Performance,” in Peer-to-Peer, ed. by A. Oram. O’Reilly: Sebastopol, CA, USA (2001).Google Scholar
  16. 22.
    B. A. Huberman and L. A. Adamic, “Internet: growth dynamics of the world-wide web,” Nature 401, 131 (1999).Google Scholar
  17. 23.
    S. Milgram, “The small world problem,” Psychology Today 1(1), 60–67 (1967).Google Scholar
  18. 25.
    M. K. Reiter and A. D. Rubin, “Anonymous web transactions with Crowds,” Communications of the ACM 42(2), 32–38 (1999).CrossRefGoogle Scholar
  19. 27.
    M. Richtel and S. Robinson, “Several web sites are attacked on day after assault shut Yahoo,” The New York Times, February 9, 2000.Google Scholar
  20. 28.
    J. Rosen, “The eroded self,” The New York Times, April 30, 2000.Google Scholar
  21. 29.
    A. S. Tanenbaum, Modern Operating Systems. Prentice-Hall: Upper Saddle River, NJ, USA (1992).Google Scholar
  22. 30.
    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).Google Scholar
  23. 31.
    D. Watts and S. Strogatz, “Collective dynamics of’ small-world’ networks,” Nature 393, 440–442 (1998).CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Ian Clarke
    • 1
  • Oskar Sandberg
    • 2
  • Brandon Wiley
    • 3
  • Theodore W. Hong
    • 4
  1. 1.Uprizer, Inc.Santa MonicaUSA
  2. 2.StockholmSweden
  3. 3.AustinUSA
  4. 4.Department of Computing, Imperial College of ScienceTechnology and MedicineLondonUK

Personalised recommendations