12,000

We have over 12,000 students, from over 100 countries, within one of the safest campuses in the UK

93%

93% of Lancaster students go into work or further study within six months of graduating

Home > Research > Publications & Outputs > Authentication in stealth distributed hash tables
View graph of relations

« Back

Authentication in stealth distributed hash tables

Research output: Contribution to journalJournal article

Published

Journal publication date06/2008
JournalJournal of Systems Architecture
Journal number6
Volume54
Number of pages12
Pages607 - 618
Original languageEnglish

Abstract

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)