By Topic

Analysis and optimization of routing trust values in a Kademlia-based Distributed Hash Table in a malicious environment

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Kohnen, M. ; Comput. Networking Technol. Group, Univ. of Duisburg-Essen, Duisburg, Germany

Trust management in peer-to-peer (P2P) networks is a current topic. Most of the current work focuses on a “clean routing table”, aiming to keep it free from malicious nodes. We follow a different approach which can be characterized as “clean routing process”: All kinds of nodes may be contained in a node's routing table. During the routing process, only trustworthy nodes shall be used for determining the next hop and finally for storing or retrieving content items. The trust values are stored in a distributed way and the ratings must be given and stored verifiably. In this paper, we present the results of implementing our trust concept into a Kademliabased Distributed Hash Table (DHT). We analyze the distribution of the routing trust values and introduce malicious nodes into the network. The results show that our concept is able to identify them precisely.

Published in:

Future Internet Communications (BCFIC), 2012 2nd Baltic Congress on

Date of Conference:

25-27 April 2012