Robust Random Number Generation for Peer-to-Peer Systems

  • Baruch Awerbuch
  • Christian Scheideler
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4305)

Abstract

We consider the problem of designing an efficient and robust distributed random number generator for peer-to-peer systems that is easy to implement and works even if all communication channels are public. A robust random number generator is crucial for avoiding adversarial join-leave attacks on peer-to-peer overlay networks. We show that our new generator together with a light-weight rule recently proposed in [4] for keeping peers well-distributed can keep various structured overlay networks in a robust state even under a constant fraction of adversarial peers.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Aspnes, J., Shah, G.: Skip graphs. In: Proc. of the 14th ACM Symp. on Discrete Algorithms (SODA), pp. 384–393 (2003)Google Scholar
  2. 2.
    Awerbuch, B., Scheideler, C.: Group Spreading: A protocol for provably secure distributed name service. In: Proc. of the 31st International Colloquium on Automata, Languages and Programming (ICALP) (2004)Google Scholar
  3. 3.
    Awerbuch, B., Scheideler, C.: Robust distributed name service. In: Voelker, G.M., Shenker, S. (eds.) IPTPS 2004. LNCS, vol. 3279, pp. 237–249. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  4. 4.
    Awerbuch, B., Scheideler, C.: 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. 5.
    Ben-Or, M., Kelmer, B., Rabin, T.: Asynchronous secure computations with optimal resilience. In: Proc. of the 13th ACM Symp. on Principles of Distributed Computing (PODC), pp. 183–192 (1994)Google Scholar
  6. 6.
    Castro, M., Druschel, P., Ganesh, A., Rowstron, A., Wallach, D.: Security for structured peer-to-peer overlay networks. In: Proc. of the 5th Usenix Symp. on Operating Systems Design and Implementation (OSDI) (2002)Google Scholar
  7. 7.
    Castro, M., Liskov, B.: Practical Byzantine fault tolerance. In: Proc. of the 2nd Usenix Symp. on Operating Systems Design and Implementation (OSDI) (1999)Google Scholar
  8. 8.
    Crosby, S., Wallach, D.: Denial of service via algorithmic complexity attacks. In: Usenix Security (2003)Google Scholar
  9. 9.
    Douceur, J.R.: The sybil attack. In: Proc. of the 1st International Workshop on Peer-to-Peer Systems (IPTPS) (2002)Google Scholar
  10. 10.
    Fiat, A., Saia, J., Young, M.: Making Chord Robust to Byzantine Attacks. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 803–814. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  11. 11.
    Goldreich, O.: Modern Cryptography, Probabilistic Proofs and Pseudorandomness. Algorithms and Combinatorics, vol. 17. Springer, Heidelberg (1998)Google Scholar
  12. 12.
    Halevi, S., Micali, S.: Practical and provably-secure commitment schemes from collision-free hashing. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 201–215. Springer, Heidelberg (1996)Google Scholar
  13. 13.
    Karger, D., Lehman, E., Leighton, T., Levine, M., Lewin, D., Panigrahi, R.: 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), pp. 654–663 (1997)Google Scholar
  14. 14.
    King, V., Saia, J., Sanwalani, V., Vee, E.: 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)Google Scholar
  15. 15.
    Kuhn, F., Schmid, S., Wattenhofer, R.: A self-repairing peer-to-peer system resilient to dynamic adversarial churn. In: Castro, M., van Renesse, R. (eds.) IPTPS 2005. LNCS, vol. 3640, pp. 13–23. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  16. 16.
    Luby, M.: Pseudorandomness and Cryptographic Applications. Princeton University Press, Princeton (1996)MATHGoogle Scholar
  17. 17.
    Naor, M.: Bit commitment using pseudorandomness. Journal of Cryptology 4(2), 151–158 (1991)MATHCrossRefGoogle Scholar
  18. 18.
    Naor, M., Wieder, U.: Novel architectures for P2P applications: the continuous-discrete approach. In: Proc. of the 15th ACM Symp. on Parallel Algorithms and Architectures (SPAA) (2003)Google Scholar
  19. 19.
    Nielson, S.J., Crosby, S.A., Wallach, D.S.: A taxonomy of rational attacks. In: Castro, M., van Renesse, R. (eds.) IPTPS 2005. LNCS, vol. 3640, pp. 36–46. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  20. 20.
    Plaxton, G., Rajaraman, R., Richa, A.W.: Accessing nearby copies of replicated objects in a distributed environment. In: Proc. of the 9th ACM Symp. on Parallel Algorithms and Architectures (SPAA), pp. 311–320 (1997)Google Scholar
  21. 21.
    Ramasamy, H.V., Cachin, C.: Parsimonious asynchronous byzantine-fault-tolerant atomic broadcast. In: Anderson, J.H., Prencipe, G., Wattenhofer, R. (eds.) OPODIS 2005. LNCS, vol. 3974, pp. 88–102. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  22. 22.
    Rhea, S., Geels, D., Roscoe, T., Kubiatowicz, J.: Handling churn in a DHT. In: USENIX Annual Technical Conference (2004)Google Scholar
  23. 23.
    Ritter, T.: RNG implementations: A literature survey, http://www.ciphersbyritter.com/RES/RNGENS.HTM
  24. 24.
    Saia, J., Fiat, A., Gribble, S.D., Karlin, A.R., Saroiu, S.: Dynamically fault-tolerant content addressable networks. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, p. 270. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  25. 25.
    Scheideler, C.: How to spread adversarial nodes? Rotate? In: Proc. of the 37th ACM Symp. on Theory of Computing (STOC), pp. 704–713 (2005)Google Scholar
  26. 26.
    Singh, A., Castro, M., Rowstron, A., Druschel, P.: Defending against Eclipse attacks on overlay networks. In: Proc. of the 11th ACM SIGOPS European Workshop (2004)Google Scholar
  27. 27.
    Sit, E., Morris, R.: Security considerations for peer-to-peer distributed hash tables. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, p. 261. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  28. 28.
    Srinathan, K., Rangan, C.P.: Efficient asynchronous secure multiparty distributed computation. In: Proc. of the 1st Int. Conference on Progress in Cryptology, pp. 117–129 (2000)Google Scholar
  29. 29.
    Srivatsa, M., Liu, L.: Vulnerabilities and security threats in structured overlay networks: A quantitative analysis. In: ACSAC (2004)Google Scholar
  30. 30.
    Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for Internet applications. In: Proc. of the ACM SIGCOMM 2001 (2001); See also, http://www.pdos.lcs.mit.edu/chord/
  31. 31.
    Viega, J.: Practical random number generation in software. In: Proc. of the 19th Annual Computer Security Applications Conference (2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Baruch Awerbuch
    • 1
  • Christian Scheideler
    • 2
  1. 1.Dept. of Computer ScienceJohns Hopkins UniversityBaltimoreUSA
  2. 2.Institute for Computer ScienceTU MunichGarchingGermany

Personalised recommendations