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 in Book/Report/ProceedingsPaper

Published

Publication date28/08/2006
Host publication32nd Euromicro Conference on Software Engineering and Advanced Applications, 2006
PublisherIEEE
Pages348-355
Number of pages8
ISBN (Print)0-7695-2594-6
Original languageEnglish

Conference

Conference32nd Euromicro Conference on Software Engineering and Advanced Applications
CityCavtat/Dubrovnik, Croatia
Period28/08/061/09/06

Conference

Conference32nd Euromicro Conference on Software Engineering and Advanced Applications
CityCavtat/Dubrovnik, Croatia
Period28/08/061/09/06

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