Secure P2P topology based on a multidimensional DHT space mapping

Distributed search and routing algorithms based on the DHT (distributed hash table) protocol have attracted considerable attention in structured P2P (peer-to-peer) research as a result of favorable properties such as distribution, self-organization, and high scalability. Compared with a traditional C/S (client/server) network, the probability of peers initiating malicious behavior increases dramatically because of their self-governing and dynamic characteristics, which also make it harder to satisfy the peers’ security required by DHT. In this paper, we propose a new secure DHT protocol based on a multidimensional mapping mechanism. This mechanism maps peers to a multidimensional space by dividing the identifiers into groups. Moreover, a series of secure methods and routing algorithms are provided to achieve secure DHT in smaller spaces. Compared with state-of-the-art approaches, the theoretical analysis and experimental results show that the multidimensional mapping mechanism can effectively improve the average success rate of a resource search by inhibiting malicious behavior.

[1]  YU Zhi-hua.  Analysis of malicious behaviors in peer-to-peer trust model , 2007 .

[2]  Jeong Hyun Yi,et al.  On the utility of distributed cryptography in P2P and MANETs: the case of membership control , 2003, 11th IEEE International Conference on Network Protocols, 2003. Proceedings..

[3]  Partha Dasgupta,et al.  Distributed authentication for peer-to-peer networks , 2003, 2003 Symposium on Applications and the Internet Workshops, 2003. Proceedings..

[4]  Peter Druschel,et al.  Peer-to-peer systems , 2010, Commun. ACM.

[5]  Karl Aberer,et al.  A Probabilistic Approach to Predict Peers? Performance in P2P Networks , 2004, CIA.

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

[7]  Jan Camenisch,et al.  Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials , 2002, CRYPTO.

[8]  Akinori Yonezawa,et al.  Software Security — Theories and Systems , 2003, Lecture Notes in Computer Science.

[9]  Josh Benaloh,et al.  One-Way Accumulators: A Decentralized Alternative to Digital Sinatures (Extended Abstract) , 1994, EUROCRYPT.

[10]  Haiyun Luo,et al.  Ubiquitous and Robust Authentication Services for Ad Hoc Wireless Networks , 2000 .

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

[12]  Antonio F. Gómez-Skarmeta,et al.  A novel methodology for constructing secure multipath overlays , 2005, IEEE Internet Computing.

[13]  Jaehoon Nah,et al.  The Secure Routing Mechanism for DHT-based Overlay Network , 2008, 2008 10th International Conference on Advanced Communication Technology.

[14]  John R. Douceur,et al.  The Sybil Attack , 2002, IPTPS.

[15]  Hector Garcia-Molina,et al.  DHT Routing Using Social Links , 2004, IPTPS.

[16]  John Kubiatowicz,et al.  Asymptotically Efficient Approaches to Fault-Tolerance in Peer-to-Peer Networks , 2003, DISC.

[17]  Jia Wang,et al.  Analyzing peer-to-peer traffic across large networks , 2004, IEEE/ACM Trans. Netw..

[18]  Ilyoung Chong,et al.  A Self-organized Authentication Architecture in Mobile Ad-Hoc Networks , 2005, ICOIN.

[19]  Michael Schukat,et al.  Authentication Using Virtual Certificate Authorities: A New Security Paradigm for Wireless Sensor Networks , 2010, 2010 Ninth IEEE International Symposium on Network Computing and Applications.