Robust random number generation for peer-to-peer systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4305 LNCS, Issue , 2006, Pages 275-289

  Awerbuch, Baruch ^a   Scheideler, Christian ^b  

^a Whiting School of Engineering   (United States)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED DATABASE SYSTEMS; NUMBER THEORY; OVERLAY NETWORKS; RANDOM NUMBER GENERATION;

LIGHT WEIGHT; PEER-TO-PEER OVERLAYS; PEER-TO-PEER SYSTEM; RANDOM NUMBER GENERATORS; STRUCTURED OVERLAY NETWORK;

PEER TO PEER NETWORKS;

EID: 84885718443     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11945529_20     Document Type: Conference Paper

References (31)

1. J. Aspnes and G. Shah. Skip graphs. In Proc. of the 14th ACM Symp. on Discrete Algorithms (SODA), pages 384-393, 2003.
2. B. Awerbuch and 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 and C. Scheideler. Robust distributed name service. In Proc. of the 3rd International Workshop on Peer-to-Peer Systems (IPTPS), 2004.
4. B. Awerbuch and 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, and T. Rabin. Asynchronous secure computations with optimal resilience. In Proc. of the 13th ACM Symp. on Principles of Distributed Computing (PODC), pages 183-192, 1994.
6. M. Castro, P. Druschel, A. Ganesh, A. Rowstron, and 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 and B. Liskov. Practical Byzantine fault tolerance. In Proc. of the 2nd Usenix Symp. on Operating Systems Design and Implementation (OSDI), 1999.
8. S. Crosby and D. Wallach. Denial of service via algorithmic complexity attacks. In 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. A. Fiat, J. Saia, and M. Young. Making Chord robust to Byzantine attacks. In Proc. of the European Symposium on Algorithms (ESA), 2005.
11. O. Goldreich. Modern Cryptography, Probabilistic Proofs and Pseudorandomness, volume 17 of Algorithms and Combinatorics. Springer-Verlag, 1998.
12. S. Halevi and S. Micali. Practical and provably-secure commitment schemes from collision-free hashing. In CRYPTO 96, pages 201-215, 1996.
13. D. Karger, E. Lehman, T. Leighton, M. Levine, D. Lewin, and 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), pages 654-663, 1997.
14. V. King, J. Saia, V. Sanwalani, and 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.
15. F. Kuhn, S. Schmid, and 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.
16. M. Luby. Pseudorandomness and Cryptographic Applications. Princeton University Press, 1996.
17. M. Naor. Bit commitment using pseudorandomness. Journal of Cryptology, 4(2):151-158, 1991.
18. M. Naor and 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.
19. S. Nielson, S. Crosby, and D. Wallach. Kill the messenger: A taxonomy of rational attacks. In Proc. of the 4th International Workshop on Peer-to-Peer Systems (IPTPS), 2005.
20. G. Plaxton, R. Rajaraman, and 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), pages 311-320, 1997.
21. H.V. Ramasamy and C. Cachin. Parsimonious asynchronous Byzantine-fault-tolerant atomic broadcast. In 9th Conference on Principles of Distributed Systems (OPODIS), pages 88-102, 2005.
22. S. Rhea, D. Geels, T. Roscoe, and J. Kubiatowicz. Handling churn in a DHT. In USENIX Annual Technical Conference, 2004.
23. T. Ritter. RNG implementations: A literature survey. http://www. ciphersbyritter.com/RES/RNGENS.HTM.
24. J. Saia, A. Fiat, S. Gribble, A. Karlin, and S. Saroiu. Dynamically fault-tolerant content addressable networks. In Proc. of the 1st International Workshop on Peerto-Peer Systems (IPTPS), 2002.
25. C. Scheideler. How to spread adversarial nodes? Rotate! In Proc. of the 37th ACM Symp. on Theory of Computing (STOC), pages 704-713, 2005.
26. A. Singh, M. Castro, A. Rowstron, and P. Druschel. Defending against Eclipse attacks on overlay networks. In Proc. of the 11th ACM SIGOPS European Workshop, 2004.
27. E. Sit and R. Morris. Security considerations for peer-to-peer distributed hash tables. In Proc. of 1st International Workshop on Peer-to-Peer Systems (IPTPS), 2002.
28. K. Srinathan and C.P. Rangan. Efficient asynchronous secure multiparty distributed computation. In Proc. of the 1st Int. Conference on Progress in Cryptology, pages 117-129, 2000.
29. M. Srivatsa and 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.
30. I. Stoica, R. Morris, D. Karger, M.F. Kaashoek, and 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/.
31. J. Viega. Practical random number generation in software. In Proc. of the 19th Annual Computer Security Applications Conference, 2003.