Scalable Information Systems. 4th International ICST Conference, INFOSCALE 2009, Hong Kong, June 10-11, 2009, Revised Selected Papers

Research Article

A Multidimensional Mapping Mechanism Based Secure Routing Method for DHT

Download
418 downloads
  • @INPROCEEDINGS{10.1007/978-3-642-10485-5_14,
        author={Zhixin Sun and Kai Bu and Ke Ding},
        title={A Multidimensional Mapping Mechanism Based Secure Routing Method for DHT},
        proceedings={Scalable Information Systems. 4th International ICST Conference, INFOSCALE 2009, Hong Kong, June 10-11, 2009, Revised Selected Papers},
        proceedings_a={INFOSCALE},
        year={2012},
        month={5},
        keywords={Multidimensional Mapping Mechanism DHT (Distributed Hash Table) Routing Attack Secure Routing},
        doi={10.1007/978-3-642-10485-5_14}
    }
    
  • Zhixin Sun
    Kai Bu
    Ke Ding
    Year: 2012
    A Multidimensional Mapping Mechanism Based Secure Routing Method for DHT
    INFOSCALE
    Springer
    DOI: 10.1007/978-3-642-10485-5_14
Zhixin Sun,*, Kai Bu1,*, Ke Ding1
  • 1: Nanjing University of Posts and Telecommunications
*Contact email: sunzx@njupt.edu.cn, bukai521@yahoo.com

Abstract

For improving the routing security of traditional DHT, in this paper, a Multidimensional Mapping Mechanism and a secure routing method based on it are proposed against various routing attacks. The proposed mechanism, which maps the resource search and related peers to a smaller space following the same topology with current DHT protocol to simplify the routing operation and decrease the coupling degree between security mechanisms and routing geometry, lays a solid foundation for applying to diversified DHT protocols. The subsequently proposed security measures based on Multidimensional Mapping Mechanism for DHT routing still keeps independent of certain DHT protocol. It pervades throughout the whole routing process, and peers could correct the malicious routing under its security rules. The theoretical analysis and simulation experiment result show that the secure routing method proposed in this paper can improve the average success ratio of lookup through effectively inhibiting malicious behavior.