Home // AP2PS 2011, The Third International Conference on Advances in P2P Systems // View article

Applying Certificate-Based Routing to a Kademlia-Based Distributed Hash Table

Authors:
Michael Kohnen
Jan Gerbecks
Erwin P. Rathgeb

Keywords: DHT; Security; Kademlia; Trust; Reputation; Certificates

Abstract:
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.

Pages: 85 to 89

Copyright: Copyright (c) IARIA, 2011

Publication date: November 20, 2011

Published in: conference

ISBN: 978-1-61208-173-1

Location: Lisbon, Portugal

Dates: from November 20, 2011 to November 25, 2011