Research Article
Towards Secure Distributed Hash Table
@INPROCEEDINGS{10.1007/978-3-319-28910-6_23, author={Zhe Wang and Naftaly Minsky}, title={Towards Secure Distributed Hash Table}, proceedings={Collaborative Computing: Networking, Applications, and Worksharing. 11th International Conference, CollaborateCom 2015, Wuhan, November 10-11, 2015, China. Proceedings}, proceedings_a={COLLABORATECOM}, year={2016}, month={2}, keywords={Distributed hash table Fault tolerance Collaboration Security Governed Chord Sybil attack Routing attack}, doi={10.1007/978-3-319-28910-6_23} }- Zhe Wang
Naftaly Minsky
Year: 2016
Towards Secure Distributed Hash Table
COLLABORATECOM
Springer
DOI: 10.1007/978-3-319-28910-6_23
Abstract
A distributed hash table (DHT) provides decentralized lookup service for distributed applications. All current implementations of DHT are achieved by the individual components being run by the participants of the application in question. Namely, the correctness of the DHT relies on that all the participants follow the same protocol. Unfortunately, this aspect of the current approach makes DHT seriously vulnerable to attacks. Such security and fault tolerance concerns about DHT prompted several attempts to improve the vulnerability of DHT. However, all the proposed solutions also rely on the code to be executed correctly. We present in this paper a novel way for implementing DHT, giving rise to an architecture we call GDHT, for Governed Distributed Hash Table. GDHT implements the required protocol with a powerful means for establishing policies governing the behaviors of the participants of DHT. By carrying out the protocol by an equally distributed middleware, the correctness of the execution of routing algorithm is guaranteed. Moreover, the execution of the security module and improvements on routing algorithm can also be ensured.
