1. S. Adler, “The Slashdot effect: an analysis of three Internet publications,”Linux Gazette issue 38, March 1999.

   Google Scholar 

2. R. Albert, H. Jeong, and A. Barabási, “Error and attack tolerance of complex networks,”Nature406, 378–382 (2000).

   Article  Google Scholar 

3. 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. R. J. Anderson, “The Eternity service,” inProceedings of the 1st International Conference on the Theory and Applications of Cryptology (PRAGOCRYPT’ 96), Prague, Czech Republic (1996).

   Google Scholar 

5. O. Berthold, H. Federrath, and S. Köpsell, “Web MIXes: a system for anonymous and unobservable Internet access,” inProceedings of the Workshop on Design Issues in Anonymity and Unobservability, Berkeley, CA, USA. Springer: New York (2001).

   Google Scholar 

6. D. L. Chaum, “Untraceable electronic mail, return addresses, and digital pseudonyms,”Communications of the ACM24(2), 84–88(1981).

   Article  Google Scholar 

7. Y. Chen, J. Edler, A. Goldberg, A. Gottlieb, S. Sobti, and P. Yianilos, “A proto-type implementation of archival intermemory,” inProceedings of the Fourth ACM Conference on Digital Libraries (DL’ 99), Berkeley, CA, USA. ACM Press: New York (1999).

   Google Scholar 

8. B. Chor, O. Goldreich, E. Kushilevitz, and M. Sudan, “Private information retrieval,”Journal of the ACM45(6), 965–982 (1998).

   Article MATH MathSciNet  Google Scholar 

9. I. Clarke, “A distributed decentralised information storage and retrieval system,” unpublished report, Division of Informatics, University of Edinburgh (1999). Available athttp://www.freenetproject.org/ (2000).

10. L. Cottrell, “Frequently asked questions about Mixmaster remailers,”http://www.obscura.com/~loki/remailer/mixmaster-faq.html (2000).

11. R. Dingledine, M. J. Freedman, and D. Molnar, “The Free Haven project: distributed anonymous storage service,” inProceedings of the Workshop on Design Issues in Anonymity and Unobservability, Berkeley, CA, USA. Springer: New York(2001).

    Google Scholar 

12. D. J. Ellard, J. M. Megquier, and L. Park, “The INDIA protocol,”http://www.eecs.harvard.edu/~ellard/India-WWW/ (2000).

13. I. Goldberg and D. Wagner, “TAZ servers and the rewebber network: enabling anonymous publishing on the world wide web,”First Monday3(4) (1998).

    Google Scholar 

14. D. Goldschlag, M. Reed, and P. Syverson, “Onion routing for anonymous and private Internet connections,”Communications of the ACM42(2), 39–41 (1999).

    Article  Google Scholar 

15. T. Hong, “Performance,” inPeer-to-Peer, ed. by A. Oram. O’Reilly: Sebastopol, CA, USA (2001).

    Google Scholar 

16. B. A. Huberman and L. A. Adamic, “Internet: growth dynamics of the world-wide web,”Nature401, 131 (1999).

    Google Scholar 

17. S. Milgram, “The small world problem,”Psychology Today1(1), 60–67 (1967).

    Google Scholar 

18. M. K. Reiter and A. D. Rubin, “Anonymous web transactions with Crowds,”Communications of the ACM42(2), 32–38 (1999).

    Article  Google Scholar 

19. 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. J. Rosen, “The eroded self,”The New York Times, April 30, 2000.

    Google Scholar 

21. A. S. Tanenbaum,Modern Operating Systems. Prentice-Hall: Upper Saddle River, NJ, USA (1992).

    Google Scholar 

22. M. Waldman, A. D. Rubin, and L. F. Cranor, “Publius: a robust, tamper-evident, censorship-resistant, web publishing system,” inProceedings of the Ninth USENIX Security Symposium, Denver, CO, USA (2000).

    Google Scholar 

23. D. Watts and S. Strogatz, “Collective dynamics of’ small-world’ networks,”Nature393, 440–442 (1998).

    Article  Google Scholar 

Download references