Robust random number generation for peer-to-peer systems

Theoretical Computer Science

Volumn 410, Issue 6-7, 2009, Pages 453-466

  Awerbuch, Baruch ^a   Scheideler, Christian ^b  

^a Johns Hopkins University   (United States)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

Join leave attacks; Peer to peer systems; Random number generation

Indexed keywords

ALGORITHMS; CLIENT SERVER COMPUTER SYSTEMS; DISTRIBUTED COMPUTER SYSTEMS; NUMBER THEORY; OVERLAY NETWORKS; PARALLEL ALGORITHMS; PARALLEL ARCHITECTURES; TELECOMMUNICATION NETWORKS;

COMMUNICATION CHANNELS; JOIN-LEAVE ATTACKS; PEER-TO-PEER SYSTEMS; RANDOM NUMBER GENERATOR (RNG);

RANDOM NUMBER GENERATION;

EID: 58549113189     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2008.10.003     Document Type: Article

References (34)

1. J. Aspnes, G. Shah, Skip graphs, in: Proc. of the 14th ACM Symp. on Discrete Algorithms, SODA, 2003, pp. 384-393
2. B. Awerbuch, C. Scheideler, Group Spreading: A protocol for provably secure distributed name service, in: Proc. of the 31st International Colloquium on Automata, Languages and Programming, ICALP, 2004
3. B. Awerbuch, C. Scheideler, Robust distributed name service, in: Proc. of the 3rd International Workshop on Peer-to-Peer Systems, IPTPS, 2004
4. B. Awerbuch, C. Scheideler, Towards a scalable and robust DHT, in: Proc. of the 18th ACM Symp. on Parallel Algorithms and Architectures, SPAA, 2006. See also http://www14.in.tum.de/personen/scheideler
5. M. Ben-Or, B. Kelmer, T. Rabin, Asynchronous secure computations with optimal resilience, in: Proc. of the 13th ACM Symp. on Principles of Distributed Computing, PODC, 1994, pp. 183-192
6. M. Castro, P. Druschel, A. Ganesh, A. Rowstron, D. Wallach, Security for structured peer-to-peer overlay networks, in: Proc. of the 5th Usenix Symp. on Operating Systems Design and Implementation, OSDI, 2002
7. M. Castro, B. Liskov, Practical Byzantine fault tolerance, in: Proc. of the 2nd Usenix Symp. on Operating Systems Design and Implementation, OSDI, 1999
8. Crosby S., and Wallach D. Denial of service via algorithmic complexity attacks. Usenix Security (2003)
9. J.R. Douceur, The sybil attack, in: Proc. of the 1st International Workshop on Peer-to-Peer Systems, IPTPS, 2002
10. D. Dubhashi, A. Panconesi, Concentration of measure for the analysis of randomized algorithms, Unpublished manuscript. Accessible via http://www.cs.unibo.it/~pancones/papers.html, October 20, 1998
11. A. Fiat, J. Saia, M. Young, Making chord robust to Byzantine attacks, in: Proc. of the European Symposium on Algorithms, ESA, 2005
12. Goldreich O. Modern Cryptography, Probabilistic Proofs and Pseudorandomness. Algorithms and Combinatorics vol. 17 (1998), Springer-Verlag
13. S. Halevi, S. Micali, Practical and provably-secure commitment schemes from collision-free hashing, in: CRYPTO 96, 1996, pp. 201-215
14. D. Karger, E. Lehman, T. Leighton, M. Levine, D. Lewin, R. Panigrahi, Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web, in: 29th ACM Symp. on Theory of Computing, STOC, 1997, pp. 654-663
15. V. King, J. Saia, V. Sanwalani, E. Vee, Towards a secure and scalable computation in peer-to-peer networks, in: Proc. of the 47th IEEE Symp. on Foundations of Computer Science, FOCS, 2006
16. F. Kuhn, S. Schmid, R. Wattenhofer, A self-repairing peer-to-peer system resilient to dynamic adversarial churn, in: Proc. of the 4th International Workshop on Peer-to-Peer Systems, IPTPS, 2005
17. Luby M. Pseudorandomness and Cryptographic Applications (1996), Princeton University Press
18. McDiarmid. Concentration. In: Habib M., McDiarmid C., Ramirez-Alfonsin J., and Reed B. (Eds). Probabilistic Methods for Algorithmic Discrete Mathematics (1998), Springer Verlag, Berlin 195-247
19. Naor M. Bit commitment using pseudorandomness. Journal of Cryptology 4 2 (1991) 151-158
20. M. Naor, U. Wieder, Novel architectures for P2P applications: The continuous-discrete approach, in: Proc. of the 15th ACM Symp. on Parallel Algorithms and Architectures, SPAA, 2003
21. S. Nielson, S. Crosby, D. Wallach, Kill the messenger: A taxonomy of rational attacks, in: Proc. of the 4th International Workshop on Peer-to-Peer Systems, IPTPS, 2005
22. G. Plaxton, R. Rajaraman, A.W. Richa, Accessing nearby copies of replicated objects in a distributed environment, in: Proc. of the 9th ACM Symp. on Parallel Algorithms and Architectures, SPAA, 1997, pp. 311-320
23. H.V. Ramasamy, C. Cachin, Parsimonious asynchronous Byzantine-fault-tolerant atomic broadcast, in: 9th Conference on Principles of Distributed Systems, OPODIS, 2005, pp. 88-102
24. S. Rhea, D. Geels, T. Roscoe, J. Kubiatowicz, Handling churn in a DHT, in: USENIX Annual Technical Conference, 2004
25. T. Ritter, RNG implementations: A literature survey. http://www.ciphersbyritter.com/RES/RNGENS.HTM
26. J. Saia, A. Fiat, S. Gribble, A. Karlin, S. Saroiu, Dynamically fault-tolerant content addressable networks, in: Proc. of the 1st International Workshop on Peer-to-Peer Systems, IPTPS, 2002
27. C. Scheideler, Probabilistic methods for coordination problems, HNI-Verlagsschriftenreihe 78, University of Paderborn, 2000. See also http://www14.in.tum.de/personen/scheideler
28. C. Scheideler, How to spread adversarial nodes? Rotate! in: Proc. of the 37th ACM Symp. on Theory of Computing, STOC, 2005, pp. 704-713
29. A. Singh, M. Castro, A. Rowstron, P. Druschel, Defending against eclipse attacks on overlay networks, in: Proc. of the 11th ACM SIGOPS European Workshop, 2004
30. E. Sit, R. Morris, Security considerations for peer-to-peer distributed hash tables, in: Proc. of 1st International Workshop on Peer-to-Peer Systems, IPTPS, 2002
31. K. Srinathan, C.P. Rangan, Efficient asynchronous secure multiparty distributed computation, in: Proc. of the 1st Int. Conference on Progress in Cryptology, 2000, pp. 117-129
32. M. Srivatsa, L. Liu, Vulnerabilities and security threats in structured overlay networks: A quantitative analysis, in: Proc. of the 20th IEEE Computer Security Applications Conference, ACSAC, 2004
33. I. Stoica, R. Morris, D. Karger, M.F. Kaashoek, H. Balakrishnan, Chord: A scalable peer-to-peer lookup service for Internet applications, in: Proc. of the ACM SIGCOMM'01, 2001. See also http://www.pdos.lcs.mit.edu/chord/
34. J. Viega, Practical random number generation in software, in: Proc. of the 19th Annual Computer Security Applications Conference, 2003