Applying trust and reputation mechanisms to a Kademlia-based Distributed Hash Table

Trust and reputation management in peer-to-peer (P2P) networks is a current topic. Most of the works focus on unstructured networks. The existing work operating in structured networks concentrates on a “clean routing table” and aims to keep malicious nodes from it. We follow a different approach which we call “clean routing process”: There are no restrictions regarding the nodes that may be contained in a node´s routing table. However, only trustworthy nodes shall be used for determining the next hop and eventually for storing or retrieving content items. To achieve this, we present a collation of security measures to avoid common threats and link them to form a secure environment.