Home > Research > Publications & Outputs > Authentication in stealth distributed hash tables

Electronic data

  • Science

    Final published version, 232 KB, PDF document


Text available via DOI:

View graph of relations

Authentication in stealth distributed hash tables

Research output: Contribution to journalJournal articlepeer-review

<mark>Journal publication date</mark>06/2008
<mark>Journal</mark>Journal of Systems Architecture
Issue number6
Number of pages12
Pages (from-to)607 - 618
Publication StatusPublished
<mark>Original language</mark>English


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. We now 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.

Bibliographic note

Selection of best papers from the 32nd EUROMICRO Conference on ˜Software Engineering and Advanced Applications" (SEAA 2006)