Improving Messaging Security in Structured P2P Overlay Networks

Peer-to-peer networking technologies are gaining increasing popularity for file sharing and media streaming applications. To support these set of applications, structured peer-to-peer (P2P) overlay networks may be employed to provide an overlay substrate. In structured P2P overlay networks, peer nodes, content objects and messages are often identified using a set of well defined identifications (Ids.) Objects are stored on peer nodes based on a set of predefined rules. Messages are routed towards the destination node, for example, the root node of the message Id, after an average of h routing hops. In the absence of faults, a high probability of successful message forwarding, i.e., a message is delivered correctly to the destination node, can be achieved even when a large fraction of the peer nodes crash. However, most current overlay networks are not secure. When one or more malicious nodes are presented in the overlay, they can prevent correct message delivery throughout the overlay. This paper studies attacks aimed at preventing correct message delivery in structured peer-to-peer overlays. Several different routing algorithms are analyzed to understand means to improve messaging security without significant additional cost.

[1]  Robert Tappan Morris,et al.  Security Considerations for Peer-to-Peer Distributed Hash Tables , 2002, IPTPS.

[2]  Miguel Castro,et al.  Secure routing for structured peer-to-peer overlay networks , 2002, OSDI '02.

[3]  Ralf Ackermann,et al.  Security-Related Issues in Peer-to-Peer Networks , 2005, Peer-to-Peer Systems and Applications.

[4]  Miguel Castro,et al.  SplitStream: high-bandwidth multicast in cooperative environments , 2003, SOSP '03.

[5]  Karl Aberer,et al.  P2P reputation management: Probabilistic estimation vs. social networks , 2006, Comput. Networks.

[6]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[7]  Peter Druschel,et al.  Pastry: Scalable, distributed object location and routing for large-scale peer-to- , 2001 .

[8]  Erik D. Demaine,et al.  EpiChord: parallelizing the chord lookup algorithm with reactive routing state management , 2004, Proceedings. 2004 12th IEEE International Conference on Networks (ICON 2004) (IEEE Cat. No.04EX955).

[9]  David R. Karger,et al.  Chord: a scalable peer-to-peer lookup protocol for internet applications , 2003, TNET.

[10]  A. Seneviratne.  Avoidance routing to misbebaving nodes in P2P by using reputation and variance , 2004, The 6th International Conference on Advanced Communication Technology, 2004..

[11]  Dan S. Wallach,et al.  A Survey of Peer-to-Peer Security Issues , 2002, ISSS.

[12]  Cláudio L. Amorim,et al.  D1HT: a distributed one hop hash table , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.

[13]  Ben Y. Zhao,et al.  Tapestry: a resilient global-scale overlay for service deployment , 2004, IEEE Journal on Selected Areas in Communications.

[14]  Jean-Yves Le Boudec,et al.  Performance analysis of the CONFIDANT protocol , 2002, MobiHoc '02.

[15]  Vivek K. Goyal,et al.  Multiple description coding: compression meets the network , 2001, IEEE Signal Process. Mag..