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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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.
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).
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.
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.
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.
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).
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.
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.
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.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sit, E., Morris, R. (2002). Security Considerations for Peer-to-Peer Distributed Hash Tables. In: Druschel, P., Kaashoek, F., Rowstron, A. (eds) Peer-to-Peer Systems. IPTPS 2002. Lecture Notes in Computer Science, vol 2429. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45748-8_25
Download citation
DOI: https://doi.org/10.1007/3-540-45748-8_25
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44179-3
Online ISBN: 978-3-540-45748-0
eBook Packages: Springer Book Archive