Security Considerations for Peer-to-Peer Distributed Hash Tables

  • Emil Sit
  • Robert Morris
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2429)

Abstract

Recent peer-to-peer research has focused on providing efficient hash lookup systems that can be used to build more complex systems. These systems hav good properties when their algorithms are executed correctly but have not generally considered how to handle misbehaving nodes. This paper looks at what sorts of security problems are inherent in large peer-to-peer systems based on distributed hash lookup systems. We examin the types of problems that such systems might face, drawing examples from existing systems, and propose some design principles for detecting and preventing these problems.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [3]
    Dabek, F., Kaashoek, M. F., Karger, D., Morris, R., and Stoica, I. Wide-area cooperativ storage with CFS. In Proceedings of the 18th ACM SOSP [2], pp. 202–215.Google Scholar
  2. [4]
    Freedman, M. J., Sit, E., CupATES, J., and Morris, R. Tarzan: A peer-to-peer anonymizing network layer. In Proceedings of the First International Workshop on Peer-to-Peer Systems (Cambridge, MA, Mar. 2002).Google Scholar
  3. [5]
    Fu, K., Kaashoek, M. F., and Maziéres, D. Fast and secure distributed read-only file system. In Proceedings of the 4th USENIX Symposium on Operating Systems Design and Implementation (OSDI) (Oct.2000), pp. 181–196.Google Scholar
  4. [6]
    Krishnamurthy, B., Wang, J., AND Xie, Y. Early measurements of a cluster-based architecture for P2P systems. In Proceedings of the First ACM SIGCOMM Internet Measurement Workshop (San Francisco, California, Nov. 2001),pp.105–109.Google Scholar
  5. [7]
    Ratnasamy, S., Francis, P., Handley, M., Karp, R., AND Shenker, S. A scalable content-addressabl network. In Proceedings of ACM SIGCOMM [1], pp. 161–172.Google Scholar
  6. [8]
    Rowstron, A., AND Druschel, P. Pastry: Scalabl,distributed object location and routing for large-scale peer-to-peer systems. In Proceedings of the 18th IFIP/ACM International Conference on Distributed Systems Platforms (Middle-ware 2001) (Nov. 2001).Google Scholar
  7. [9]
    Rowstron, A., AND Druschel, P. Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility. In Proceedings of the 18th ACM SOSP [2], pp. 188–201.Google Scholar
  8. [10]
    Rowstron, A., Kermarrec, A.-M., Castro, M., AND Druschel, P. SCRIBE The design of a large-scale event notification infrastructure. In Networked Group Communication: Third International COST264 Workshop (Nov. 2001), J. Crowcroft and M. Hofmann, Eds.,vol. 2233 of Lecture Notes in Computer Science Springer-Verlag, pp. 30–43.Google Scholar
  9. [11]
    Stoica, I., Morris, R., Karger, D., Kaashoek, M. F., AND Balakrishnan, H. Chord: A scalabl peer-to-peer lookup service for int rnet applications. In Proceedings of ACM SIGCOMM [1], pp. 149–160.Google Scholar
  10. [12]
    Zhao, B., Kubiatowicz, J., AND Joseph, A. Tapestry: An infrastructure for fault-tolerant wid-area location and routing. Tech. Rep. UCB/CSD-01-1141, Computer Scienc Division, U.C. Berkeley, Apr. 2001.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Emil Sit
    • 1
  • Robert Morris
    • 1
  1. 1.Laboratory for Computer SciencMITCambridgeUSA

Personalised recommendations