Applying Certificate-Based Routing to a Kademlia-Based Distributed Hash Table
Most Distributed Hash Table (DHT) algorithms have proven vulnerable against a multitude of attacks. Countermeasures using reputation systems to generate trust values have been developed and analyzed. These analyses mostly refer to unstructured peer-to-peer (P2P) networks. In this paper, we present our concept for applying trust values to the bootstrap, lookup, PUT and GET processes of structured P2P networks and evaluate it using the Kademlia DHT algorithm in a binary trust environment created by certificates.
Dieser Eintrag ist freigegeben.