[1]   Noga Alon, Haim Kaplan, Michael Krivelevich, Dahlia Malkhi, and Julien Stern: Scalable secure storage when half the system is faulty. In Proc. 27th Internat. Colloquium on Automata, Languages and Programming (ICALP’00), pp. 576–587. Springer, 2000. [ICALP:3l87mp6xvnxr0cfg].

[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 Proc. 37th FOCS, pp. 580–589. IEEE Computer Society, 1996. [FOCS:10.1109/SFCS.1996.548517].

[4]   Baruch Awerbuch and Christian Scheideler: Group spreading: A protocol for provably secure distributed name service. In Proc. 31st Internat. Colloquium on Automata, Languages, and Programming (ICALP’04), pp. 183–195. Springer, 2004. [ICALP:782vxmb2mlxxrmru].

[5]   Baruch Awerbuch and Christian Scheideler: Robust distributed name service. In Proc. 3rd Internat. Workshop on Peer-to-Peer Systems (IPTPS’04), pp. 237–249. Springer, 2004. [Springer:crpp90cx7r3p61t0].

[6]   M. Bellare and P. Rogaway: Random oracles are practical: A paradigm for designing efficient protocols. In Proc. 1st ACM Conf. on Computer and Communications Security, pp. 62–73. ACM Press, 1993. [ACM:168588.168596].

[7]   John Borland: Gnutella girds against spam attacks. CNET News.com, August 2000. http://news.cnet.com/news/0-1005-200-2489605.html.

[8]   Mayur Datar: Butterflies and peer-to-peer networks. In Proc. 10th European Symp. on Algorithms (ESA’02), pp. 310–322. Springer, 2002. [ESA:w83mmlkyt13lx90f].

[9]   Electronic Freedom Foundation — Censorship — Internet censorship legislation & regulation (CDA, etc.) — Archive. http://www.eff.org/pub/Censorship/Internet_censorship_bills.

[10]   Amos Fiat and Jared Saia: Censorship resistant peer-to-peer content addressable networks. In Proc. 13th ACM-SIAM Symp. on Discrete Algorithms (SODA’02), pp. 94–103. ACM Press, 2002. [SODA:545381.545392].

[11]   Amos Fiat, Jared Saia, and Maxwell Young: Making chord robust to byzantine attack. In Proc. 13th European Symposium on Algorithms (ESA’05), pp. 803–814. Springer, 2005. [ESA:422llxn7khwej72n].

[12]   D.K. Gifford: Weighted voting for replicated data. In Proc. 7th ACM Symp. on Operating Systems Principles, pp. 150–159. ACM Press, 1979. [ACM:800215.806583].

[13]   Gnutella: To the bandwidth barrier and beyond. http://dss.clip2.com/gnutella.html.

[14]   Gnutella Website. http://www.gnutella.com.

[15]   J. Håstad and F. Thomson Leighton: Fast computation using faulty hypercubes. In Proc. 21st STOC, pp. 251–263. ACM Press, 1989. [STOC:73007.73031].

[16]   Kristen Hildrum and John Kubiatowicz: Asymptotically efficient approaches to fault-tolerance in peer-to-peer networks. In Proc. 17th Internat. Symposium on Distributed Computing (DISC’03), pp. 321–336. Springer, 2003. [Springer:7emt7u01cvbb6bu6].

[17]   Index On Censorship Homepage. http://www.indexoncensorship.org.

[18]   Anna R. Karlin, Greg Nelson, and Hisao Tamaki: On the fault tolerance of the butterfly. In Proc. 26th STOC, pp. 125–133. ACM Press, 1994. [STOC:195058.195117].

[19]   M. Kashoek and D. Karger: Koorde: A simple degree-optimal distributed hash table. In Proc. 2nd Internat. Workshop on Peer-to-Peer Systems (IPTPS’03), pp. 98–107. Springer, 2003. [Springer:unmqcqy0yxpu32xp].

[20]   F. Thomson Leighton, Bruce Maggs, and Ramesh Sitamaran: On the fault tolerance of some popular bounded-degree networks. SIAM Journal on Computing, 27(5):1303–1333, 1998. [SICOMP:10.1137/S0097539793255163].

[21]   Michael G. Luby, Michael Mitzenmacher, M. Amin Shokrollahi, Daniel A. Spielman, and Volker Stemann: Practical loss-resilient codes. In Proc. 29th STOC, pp. 150–159. ACM Press, 1997. [STOC:258533.258573].

[22]   Dahlia Malkhi, Michael Reiter, and Avishai Wool: The load and availability of byzantine quorum systems. SIAM Journal on Computing, 29(6):1889–1906, 2000. [SICOMP:10.1137/S0097539797325235].

[23]   Dahlia Malkhi, Michael Reiter, Avishai Wool, and Rebecca N. Wright: Probabilistic byzantine quorum systems. In Proc. 17th Ann. ACM Symp. on Principles of Distributed Computing (PODC’98), p. 321. ACM Press, 1998. [ACM:277697.277781].

[24]   G. Manku, M. Bawa, and P. Raghavan: Symphony: Distributed hashing in a small world. In Proc. 4th USENIX Symp. on Internet Technologies and Systems (USITS’03), pp. 127–140, 2003.

[25]   P. Maymounkov and D. Mazieres: Kademlia: A peer-to-peer information system based on the XOR metric. In Proc. 1st Internat. Workshop on Peer-to-Peer Systems (IPTPS’02), pp. 53–65. Springer, 2002. [Springer:2ekx2a76ptwd24qt].

[26]   Rajeev Motwani and Prabhakar Raghavan: Randomized Algorithms. Cambridge University Press, 1995.

[27]   Moni Naor and Udi Wieder: A simple fault tolerant distributed hash table. In Proc. 2nd Internat. Workshop on Peer-to-Peer Systems (IPTPS’03), pp. 88–97. Springer, 2003. [Springer:4e756fgyq4ff4kay].

[28]   Napster Website. http://www.napster.com.

[29]   Andy Oram, editor. Peer-to-Peer: Harnessing the Power of Disruptive Technologies. O’Reilly & Associates, July 2001.

[30]   M. Pinsker: On the complexity of a concentrator. In Proc. 7th Internat. Teletraffic Conference, pp. 318/1–318/4, 1973.

[31]   C.G. Plaxton, R. Rajaraman, and A.W. Richa: Accessing nearby copies of replicated objects in a distributed environment. In Proc. 9th Ann. ACM Symp. on Parallel Algorithms and Architectures (SPAA’97), pp. 311–320. ACM Press, 1997. [SPAA:258492.258523].

[32]   Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, and Scott Shenker: A scalable content-addressable network. In Proc. ACM SIGCOMM 2001 Technical Conference, pp. 161–172. ACM Press, 2001. [ACM:964723.383072].

[33]   Antony I. T. Rowstron and Peter Druschel: Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In Proc. of the IFIP/ACM Internat. Conf. on Distributed Systems Platforms, pp. 329–350. Springer, 2001. [Springer:7y5mjjep0hqlctv6].

[34]   Stefan Saroiu, P. Krishna Gummadi, and Steven D. Gribble: A measurement study of peer-to-peer file sharing systems. In Proc. 9th Ann. Symp. on Multimedia Computing and Networking (MMNC’02). SPIE Press, 2002.

[35]   Stefan Saroiu, P. Krishna Gummadi, and Steven D. Gribble: Measuring and analyzing the characteristics of napster and gnutella hosts. Multimedia Systems, 9(2):170–184, 2003.

[36]   Christian Scheideler: How to spread adversarial nodes? Rotate! In Proc. 37th STOC, pp. 704–713. ACM Press, 2005. [STOC:1060590.1060694].

[37]   Adi Shamir: How to share a secret. Communications of the ACM, 22(11):612–613, 1979. [ACM:359168.359176].

[38]   Ion Stoica, Robert Morris, David Liben-Nowell, David R. Karger, M. Frans Kaashoek, Frank Dabek, and Hari Balakrishnan: Chord: A scalable peer-to-peer lookup protocol for internet applications. IEEE/ACM Transactions on Networking, 11(1):17–32, 2003. [doi:10.1109/TNET.2002.808407].

[39]   Marc Waldman, Aviel D. Rubin, and Lorrie Faith Cranor: Publius: A robust, tamper-evident, censorship-resistant, web publishing system. In Proc. 9th USENIX Security Symposium, pp. 59–72, August 2000.

[40]   Erping Zhang: Googling the great firewall: Google kowtowed to communist censorship. The New York Sun, 31 January 2006. http://www.nysun.com/article/26791.

[41]   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.