Peer-to-Peer-Netzwerke: Algorithmen und Methoden

Tomkins, A.: Trawling the web for emerging cyber-communities. In: Proceedings of the Eighth International World-Wide Web Conference. (1999)
    66. Huberman, B.A., Adamic, L.A.: Growth dynamics of the World-Wide Web. Nature 401 (1999) 131
    67. Crovella, M.E., Taqqu, M.S., Bestavros, A.: Heavy-tailed probability distributions in the world wide web (1998)
    68. Milgram, S.: The small world problem. Psychology Today (1967) 60-67
    69. Watts, D.J., Strogatz, S.H.: Collective dynamics of small-world networks. Nature 393 (1998) 440-442
    70. Kleinberg, J.: The small-world phenomenon: An algorithmic perspective. In: Proceedings of the 32nd ACM Symposium on Theory of Computing. (2000)
    71. Wormald, N.C.: The asymptotic connectivity of labelled regular graphs. Journal of Combinatorial Theory, Series B 31 (1981) 156-167
    72. McKay, B.D.: Subgraphs of random graphs with specified degrees. Congressus Nume- rantium 33 (1981) 213-223
    73. Gkantsidis, C., Mihail, M., Saberi, A.: Random walks in peer-to-peer networks. In: IN- FOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies. Volume 1. (2004) 120-130
    74. McKay, B.D., Wormald, N.C.: Uniform generation of random regular graphs of moderate degree. Journal of Algorithms 11 (1990) 52-67

    75. Pandurangan, G., Raghavan, P., Upfal, E.: Building low-diameter P2P networks. In: FOCS '01: Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, Washington, DC, USA, IEEE Computer Society (2001) 492
    76. Mahlmann, P., Schindelhauer, C.: Peer-to-peer networks based on random transformations of connected regular undirected graphs. In Gibbons, P.B., Spirakis, P.G., eds.: SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallel Algorithms, July 18-20, 2005, Las Vegas, Nevada, USA, ACM (2005) 155-164
    77. Mahlmann, P., Schindelhauer, C.: Distributed random digraph transformations for peerto-peer networks. In Gibbons, P.B., Vishkin, U., eds.: SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallel Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30 - August 2, 2006, ACM (2006) 308-317
    78. Montresor, A., Jelasity, M., Babaoglu, 0.: Robust aggregation protocols for large-scale overlay networks. In: Proceedings of The 2004 International Conference on Dependable Systems and Networks (DSN), Florence, Italy, IEEE Computer Society (2004) 19-28
    79. Jelasity, M., Babaoglu, 0.: T-Man: Fast gossip-based construction of large-scale overlay topologies. Technical Report UBLCS-2004-7, University of Bologna, Department of Computer Science, Bologna, Italy (2004) http://www.cs.unibo.it/techreports/2004/2004- 07.pdf.
    80. Montresor, A., Jelasity, M., Babaoglu, 0.: Chord on demand (2005)
    81. Rivest, R., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public key cryptosystems. Communications of the ACM 21 (1978) 120-126
    82. Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Transactions on Information Theory 22 (1976) 644-654
    83. Garfinkel, S.: PGP: Pretty Good Privacy. O'Reilly & Associates, Inc., Sebastopol, CA, USA (1996)
    84. Goldwasser, S., Micali, S., Rivest, R.L.: A digital signature scheme secure against adaptive chosen-message attacks. SIAM Journal on Computing 17 (1988) 281-308
    85. Mikle, 0.: Practical attacks on digital signatures using MD5 message digest. Report 2004/356, Cryptology ePrint Archive (2004)
    86. Douceur, J.R.: The Sybil attack. In Druschel, P., Kaashoek, M.F., Rowstron, A.LT., eds.: Peer-to-Peer Systems, First International Workshop, IPTPS 2002, Cambridge, MA, USA, March 7-8, 2002, Revised Papers. Volume 2429 of Lecture Notes in Computer Science., Springer (2002) 251-260
    87. Lamport, L., Shostak, R., Pease, M.: The byzantine generals problem. ACM Transactions on Programming Languages and Systems 4 (1982) 382-401
    88. Fiat, A., Saia, J.: Censorship resistant peer-to-peer content addressable networks. In: Proceedings of Symposium on Discrete Algorithms. (2002)
    89. Dingledine, R.R.: The Free Haven project: Design and deployment of an anonymous secure data haven. Master's thesis, Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science (2000)
    90. Blakley, G.R.: Safeguarding cryptographic keys. In Merwin, R.E., Zanca, J.T., Smith, M., eds.: 1979 National Computer Conference: June 4-7, 1979, New York, New York. Volume 48 of AFIPS Conference proceedings., pub-AFIPS:adr, AFIPS Press (1979) 313-317
    91. Shamir, A.: How to share