Article

Secure routing for structured peer-to-peer overlay networks

Authors:

Peter Druschel,

Ayalvadi Ganesh,

Antony Rowstron, and

Dan S. WallachAuthors Info & Claims

OSDI '02: Proceedings of the 5th symposium on Operating systems design and implementation (Copyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading)

December 2002

Pages 299 - 314

Published: 09 December 2002 Publication History

Abstract

Structured peer-to-peer overlay networks provide a substrate for the construction of large-scale, decentralized applications, including distributed storage, group communication, and content distribution. These overlays are highly resilient; they can route messages correctly even when a large fraction of the nodes crash or the network partitions. But current overlays are not secure; even a small fraction of malicious nodes can prevent correct message delivery throughout the overlay. This problem is particularly serious in open peer-to-peer systems, where many diverse, autonomous parties without preexisting trust relationships wish to pool their resources. This paper studies attacks aimed at preventing correct message delivery in structured peer-to-peer overlays and presents defenses to these attacks. We describe and evaluate techniques that allow nodes to join the overlay, to maintain routing state, and to forward messages securely in the presence of malicious nodes.

References

[1]

M. Bellare and P. Rogaway. The exact security of digital signatures- How to sign with RSA and Rabin. In Advances in Cryptology - EUROCRYPT 96, Lecture Notes in Computer Science, Vol. 1070. Springer-Verlag, 1996.]]

Digital Library

[2]

Steve Bellovin. Security aspects of Napster and Gnutella. In 2001 Usenix Annual Technical Conference, Boston, Massachusetts, June 2001. Invited talk.]]

[3]

Miguel Castro, Peter Druschel, Y. Charlie Hu, and Antony Rowstron. Exploiting network proximity in peer-to-peer overlay networks. Technical Report MSR-TR-2002-82, Microsoft Research, May 2002.]]

[4]

Miguel Castro and Barbara Liskov. Practical byzantine fault tolerance. In Proceedings of the Third Symposium on Operating Systems Design and Implementation (OSDI'99), New Orleans, Louisiana, February 1999.]]

Digital Library

[5]

Ian Clarke, Oskar Sandberg, Brandon Wiley, and Theodore W. Hong. Freenet: A distributed anonymous information storage and retrieval system. In Workshop on Design Issues in Anonymity and Unobservability, pages 311--320, July 2000. ICSI, Berkeley, California.]]

Digital Library

[6]

Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest. Introduction to Algorithms. MIT Electrical Engineering and Computer Science Series. MIT Press, 1990.]]

Digital Library

[7]

Frank Dabek, M. Frans Kaashoek, David Karger, Robert Morris, and Ion Stoica. Wide-area cooperative storage with CFS. In Proc. ACM SOSP'01, Banff, Canada, October 2001.]]

Digital Library

[8]

Drew Dean and Adam Stubblefield. Using client puzzles to protect TLS. In 10th Usenix Security Symposium, pages 1--8, Washington, D.C., August 2001.]]

Digital Library

[9]

Roger Dingledine, Michael J. Freedman, and David Molnar. Accountability measures for peer-to-peer systems. In Peer-to-Peer: Harnessing the Power of Disruptive Technologies. O'Reilly and Associates, November 2000.]]

[10]

John R. Douceur. The Sybil attack. In Proceedings for the 1st International Workshop on Peer-to-Peer Systems (IPTPS '02), Cambridge, Massachusetts, March 2002.]]

Digital Library

[11]

M. P. Herlihy and J. M. Wing. Axioms for Concurrent Objects. In Proceedings of 14th ACM Symposium on Principles of Programming Languages, pages 13--26, January 1987.]]

Digital Library

[12]

A. Herzberg, M. Jakobsson, S. Jarecki, H. Krawczyk, and M. Yung. Proactive public key and signature systems. In Proc. of the 1997 ACM Conference on Computers and Communication Security, 1997.]]

Digital Library

[13]

Ari Juels and John Brainard. Client puzzles: A cryptographic defense against connection depletion attacks. In Internet Society Symposium on Network and Distributed System Security (NDSS '99), pages 151--165, San Diego, California, February 1999.]]

[14]

Nancy Lynch, Dahlia Malkhi, and David Ratajczak. Atomic data access in content addressable networks. In Proceedings for the 1st International Workshop on Peer-to-Peer Systems (IPTPS '02), Cambridge, Massachusetts, March 2002.]]

Digital Library

[15]

Ralph C. Merkle. Secure communications over insecure channels. Communications of the ACM, 21(4):294--299, April 1978.]]

Digital Library

[16]

Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, and Scott Shenker. A scalable content-addressable network. In Proc. ACM SIGCOMM'01, San Diego, California, August 2001.]]

Digital Library

[17]

Antony Rowstron and Peter Druschel. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In Proc. IFIP/ACM Middleware 2001, Heidelberg, Germany, November 2001.]]

Digital Library

[18]

Antony Rowstron and Peter Druschel. Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility. In Proc. ACM SOSP'01, Banff, Canada, October 2001.]]

Digital Library

[19]

Emil Sit and Robert Morris. Security considerations for peer-to-peer distributed hash tables. In Proceedings for the 1st International Workshop on Peer-to-Peer Systems (IPTPS '02), Cambridge, Massachusetts, March 2002.]]

Digital Library

[20]

Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, and Hari Balakrishnan. Chord: A scalable peer-to-peer lookup service for Internet applications. In Proc. ACM SIGCOMM'01, San Diego, California, August 2001.]]

Digital Library

[21]

Ben Y. Zhao, John D. Kubiatowicz, and Anthony D. Joseph. Tapestry: An infrastructure for fault-resilient wide-area location and routing. Technical Report UCB//CSD-01-1141, U. C. Berkeley, April 2001.]]

Digital Library

Cited By

Vijayaraj ASuresh RPoonkuzhali S(2018)RETRACTED ARTICLE: Load balancing in wireless networks using reputation-ReDS in the magnified distributed hash tableMultimedia Tools and Applications10.1007/s11042-018-5620-677:8(10347-10364)Online publication date: 1-Apr-2018
https://dl.acm.org/doi/10.1007/s11042-018-5620-6
King VPettie SSaia JYoung M(2018)A resource-competitive jamming defenseDistributed Computing10.1007/s00446-017-0313-331:6(419-439)Online publication date: 1-Nov-2018
https://dl.acm.org/doi/10.1007/s00446-017-0313-3
Augustine JPandurangan GRobinson P(2016)Distributed Algorithmic Foundations of Dynamic NetworksACM SIGACT News10.1145/2902945.290295947:1(69-98)Online publication date: 10-Mar-2016
https://dl.acm.org/doi/10.1145/2902945.2902959
Show More Cited By

Secure routing for structured peer-to-peer overlay networks

Recommendations

Secure routing for structured peer-to-peer overlay networks
OSDI '02: Proceedings of the 5th Symposium on Operating Systems Design and Implementation

Structured peer-to-peer overlay networks provide a substrate for the construction of large-scale, decentralized applications, including distributed storage, group communication, and content distribution. These overlays are highly resilient; they can ...
Read More
An efficient and secure overlay network for general peer-to-peer systems
Read More
Ranking factors in peer-to-peer overlay networks

A large number of peer processes are distributed in a peer-to-peer (P2P) overlay network. It is difficult, maybe impossible for a peer to perceive the membership and location of every resource object due to the scalability and openness of a P2P network. ...
Read More

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

OSDI '02: Proceedings of the 5th symposium on Operating systems design and implementation (Copyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading)

December 2002

413 pages

ISBN:9781450301114

Program Chairs:
David Culler
University of California, Berkeley
,
Peter Druschel
Rice University

Sponsors

SIGOPS: ACM Special Interest Group on Operating Systems

Publisher

USENIX Association

United States

Publication History

Published: 09 December 2002

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

156
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Other Metrics

View Author Metrics

Citations

Cited By

Vijayaraj ASuresh RPoonkuzhali S(2018)RETRACTED ARTICLE: Load balancing in wireless networks using reputation-ReDS in the magnified distributed hash tableMultimedia Tools and Applications10.1007/s11042-018-5620-677:8(10347-10364)Online publication date: 1-Apr-2018
https://dl.acm.org/doi/10.1007/s11042-018-5620-6
King VPettie SSaia JYoung M(2018)A resource-competitive jamming defenseDistributed Computing10.1007/s00446-017-0313-331:6(419-439)Online publication date: 1-Nov-2018
https://dl.acm.org/doi/10.1007/s00446-017-0313-3
Augustine JPandurangan GRobinson P(2016)Distributed Algorithmic Foundations of Dynamic NetworksACM SIGACT News10.1145/2902945.290295947:1(69-98)Online publication date: 10-Mar-2016
https://dl.acm.org/doi/10.1145/2902945.2902959
Bender MFineman JMovahedi MSaia JDani VGilbert SPettie SYoung M(2015)Resource-Competitive AlgorithmsACM SIGACT News10.1145/2818936.281894946:3(57-71)Online publication date: 1-Sep-2015
https://dl.acm.org/doi/10.1145/2818936.2818949
Lee HSeibert JFistrovic DKillian CNita-Rotaru C(2015)GatlingACM Transactions on Information and System Security10.1145/271456517:4(1-34)Online publication date: 24-Apr-2015
https://dl.acm.org/doi/10.1145/2714565
Poh GMohd Nazir MGoi BTan SPhan RShamsudin MElçi AGaur MOrgun MMakarevich O(2013)An authentication framework for peer-to-peer cloudProceedings of the 6th International Conference on Security of Information and Networks10.1145/2523514.2523531(94-101)Online publication date: 26-Nov-2013
https://dl.acm.org/doi/10.1145/2523514.2523531
Molavi Kakhki AKliman-Silver CMislove ASchwabe DAlmeida VGlaser HBaeza-Yates RMoon S(2013)IolausProceedings of the 22nd international conference on World Wide Web10.1145/2488388.2488468(919-930)Online publication date: 13-May-2013
https://dl.acm.org/doi/10.1145/2488388.2488468
Wu SChen YFu XLi J(2012)NCShieldProceedings of the 2012 IEEE 20th International Workshop on Quality of Service10.5555/2330748.2330755(1-9)Online publication date: 4-Jun-2012
https://dl.acm.org/doi/10.5555/2330748.2330755
Nilizadeh SJahid SMittal PBorisov NKapadia ABarakat CTeixeira RRamakrishnan KThiran P(2012)CachetProceedings of the 8th international conference on Emerging networking experiments and technologies10.1145/2413176.2413215(337-348)Online publication date: 10-Dec-2012
https://dl.acm.org/doi/10.1145/2413176.2413215
Li FMittal PCaesar MBorisov NXu SYu TZhang XDing X(2012)SybilControlProceedings of the seventh ACM workshop on Scalable trusted computing10.1145/2382536.2382548(67-78)Online publication date: 15-Oct-2012
https://dl.acm.org/doi/10.1145/2382536.2382548
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

Media

Figures

Other

Tables

View Table of Contents