Censorship resistant peer-to-peer Content Addressable Networks

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 06-08-January-2002, Issue , 2002, Pages 94-103

  Fiat, Amos ^a,b   Saia, Jared ^c  

^a TEL AVIV UNIVERSITY   (Israel)

^b UNIVERSITY OF WASHINGTON   (United States)

^c University of Washington   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; INTERNET; PERSONAL COMMUNICATION SYSTEMS;

CENSORSHIP RESISTANTS; CONTENT-ADDRESSABLE NETWORKS; DATA ITEMS; OVER-COMPLETE; PEER TO PEER;

PEER TO PEER NETWORKS;

EID: 84968779644     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (27)

1. Noga Alon, Haim Kaplan, Michael Krivelevich, DahUa Malkhi, and Julien Stein. Scalable secure storage when half the system is faulty. In Proceedings of the 27th International Colloquium on Automata, Languages and Programming, 2000.
2. Noga Alon and Joel Spencer. The Probabilistic Method, 2nd Edition. John Wiley & Sons, 2000.
3. Yonatan Aumann and Michael Bender. Fault tolerant data structures. In IEEE Symposium on Foundations of Computer Science, 1996.
4. M. Bellare and P. Rogaway. Random oracles are practical: a paradigm for designing efficient protocols. In The First ACM Conference on Computer and Communications Security, pages 62-73, 1993.
5. John Borland. Gnutella girds against spam attacks. CNET News.com, August 2000. http://news.cnet.com/news/0-1005-200-2489605.html.
6. Clip2. Gnutella: To the bandwidth barrier and beyond. http://dss.chp2.com/gnutella.html.
7. Electronic Freedom Foundation. Eff -censorship -internet censorship legislation & regulation (cda, etc.) -archive. http://www.eff.org/-pub/Censorslnp/Internet-censorship-bills.
8. D.K. Gifford. Weighted voting for replicated data. In Proc. of the Seventh ACM Symposium on Operating Systems Principles, pages 150-159, 1979.
9. J. Hastad, T. Leighton, and M. Newman. Fast computation using faulty hypercubes. In Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989.
10. Anna R. Karlin, Greg Nelson, and Hisao Tamaki. On the fault tolerance of the butterfly. In ACM Symposium on Theory of Computing, 1994.
11. John Kubiatowicz, David Bindel, Yan Chen, Steven Czerwinski, Patrick Eaton, Dennis Geels, Ramakrishna Gummadi, Sean Rhea, Hakim Weatherspoon, Westley Weimer, Chris Wells, and Ben Zhao. Oceanstore: An architecture for global-scale persistent storage. In Appears in Proceedings of the Ninth international Conference on Architectural Support for Programming Lan-guages and Operating Systems (ASPLOS 2000), 2000.
12. Thomson Leighton, Bruce Maggs, and Ramesh Sitamaran. On the fault tolerance of some popular bounded-degree networks. SIAM Journal on Computing, 1998.
13. Dahlia Malkhi, Michael Reiter, and Avishai Wool. The load and availability of byzantine quorum systems. SIAM Journal of Computing, 29(6):1889-1906, 2000.
14. Dahlia Malkhi, Michael Reiter, Avishai Wool, and Rebecca N. Wright. Probabilistic byzantine quorum systems. In Symposium on Principles of Distributed Computing, 1998.
15. Aviel D. Rubin Marc Waldman and Lorrie Faith Cra-nor. Publius: A robust, tamper-evident, censorship-resistant, web publishing system. In Proc. 9th USENIX Security Symposium, pages 59-72, August 2000.
16. Robert Marquand. China's web users kept on their toes. http://www.csmonitor.com/durable/-2000/12/07/fp7sl-csm.shtml.
17. Rajeev Motwani and Prabhakar Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
18. Index on Censorship. Index on censorship homepage. http://www.indexoncensorship.org.
19. Andy Oram, editor. Peer-to-Peer: Harnessing the Power of Disruptive Technologies. O'Reilly & Associates, July 2001.
20. Gopal Pandurangan, Prabhakar Raghavan, and Eh Upfal. Building low-diameter p2p networks. In STOC 2001, Crete, Greece, 2001.
21. M. Pinsker. On the complexity of a concentrator. In 7th International Teletraffic Conference, 1973.
22. C. Plaxton, R. Rajaram, and A.W. Richa. Accessing nearby copies of replicated objects in a distributed environment. In Proceedings of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), 1997.
23. Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, and Scott Shenker. A Scalable Content-Addressable Network. In Proceedings of the ACM SIG-GOMM 2001 Technical Conference, San Diego, CA, USA, August 2001.
24. Stefan Saroiu, P. Krishna Gummadi, and Steven D. Gribble. A Measurement Study of Peer-to-Peer File Sharing Systems. In Proceedings of Multimedia Computing and Networking, 2002.
25. Adi Shamir. How to share a secret. Communications of the ACM, 22, pp. 612-613, 1979.
26. Ion Stoica, Robert Morris, David Karger, Frans Kaashoek, and Hari Balakrishnan. Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications. In Proceeding of the ACM SIGGOMM 2001 Technical Conference, San Diego, CA, USA, August 2001. Gnutella website, http://gnutella.wego.com/. Napster website, http://www.napster.com/.
27. B.Y. Zhao, K.D. Kubiatowicz, and A.D. Joseph. Tapestry: An Infrastructure for Fault-Resilient Wide-Area Location and Routing. Technical Report UCB//CSD-01-1141, University of California at Berkeley Technical Report, April 2001.