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.
Keywordsmultidimensional mapping DHT (distributed hash table) structured P2P (peer-to-peer) network routing attack security
Unable to display preview. Download preview PDF.
- 1.Eric R. Introduction to distributed Hash tables. IETF-65 Technical Plenary. 2006Google Scholar
- 3.Wallach D S. A survey of peer-to-peer security issues. In: Okada M, Pierce B, Scedrov A, et al., eds. Software Security-Theories and Systems. Berlin: Springer-Verlag 2002. 42–57Google Scholar
- 4.Hyeokchan K, Sunkee K, Jaehoon N, et al. The secure routing mechanism for DHT-based overlay network. In: Proceedings of the 10th International Conference on Advanced Communication Technology. Gangwon-Do: IEEE Press, 2008. 1300–1303Google Scholar
- 6.Hildrum K, Kubiatowicz J. Asymptotically efficient approaches to fault-tolerance in peer-to-peer networks. LNCS, 2003, 2848: 321–336Google Scholar
- 7.Luo H, Lu S. Ubiquitous and Robust Authentication Services for Ad Hoc Wireless Networks. Technical Report UCLACSD-TR-200030. Los Angeles: University of California, 2000Google Scholar
- 8.Seongil H, Yongjae J, Seunghee Y, et al. A self-organized authentication architecture in mobile Ad-hoc networks. In: Proceedings of International Conference on Information Networking. Jeju Island: Springer, 2005. 689–696Google Scholar
- 9.Narasimha M, Tsudik G, Yi J H. On the utility of distributed cryptography in P2P and MANETs: the case of membership control. In: Proceedings of 11th IEEE International Conference on Network Protocols. Atlanta: IEEE Press, 2003. 336–345Google Scholar
- 11.Benaloh J, Automation G. One-way accumulators: a decentralized alternative to digital signatures. LNCS, 1994, 765: 274–285Google Scholar
- 13.Holohan, Edmond S, Michael. Authentication using virtual certificate authorities: a new security paradigm for wireless sensor networks. In: Proceedings of IEEE Network Computing and Applications (NCA). Cambridge: IEEE Press, 2010. 92–99Google Scholar
- 15.Marti S, Ganesan P, Garcia-Molina H. DHT routing using social links. LNCS, 2005, 3279: 100–111Google Scholar
- 16.Yu Z-H. Analysis of malicious behaviors in peer-to-peer trust model. Comput Eng Appl, 2007, 43: 18–21Google Scholar
- 17.Despotovic Z, Aberer K. A probabilistic approach to predict peers’ performance in P2P networks. LNCS, 2004, 3191: 62–76Google Scholar