By Topic

Authentication in Stealth Distributed Hash Tables

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

5 Author(s)
MacQuire, A. ; Dept. of Comput., Lancaster Univ. ; Brampton, A. ; Rai, I.A. ; Race, N.J.P.
more authors

Most existing DHT algorithms assume that all nodes have equal capabilities. This assumption has previously been shown to be untrue in real deployments, where the heterogeneity of nodes can actually have a detrimental effect upon performance. In this paper, we acknowledge that nodes on the same overlay may also differ in terms of their trustworthiness. However, implementing and enforcing security policies in a network where all nodes are treated equally is a non-trivial task. We therefore extend our previous work on stealth DHTs to consider the differentiation of nodes based on their trustworthiness rather than their capabilities alone

Published in:

Software Engineering and Advanced Applications, 2006. SEAA '06. 32nd EUROMICRO Conference on

Date of Conference:

Aug. 29 2006-Sept. 1 2006