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

Electronic data

  • Science

    Final published version, 232 KB, PDF document

Links

Text available via DOI:

View graph of relations

Authentication in stealth distributed hash tables

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Published

Standard

Authentication in stealth distributed hash tables. / MacQuire, Andrew; Brampton, Andrew; Rai, Idris A. et al.
In: Journal of Systems Architecture, Vol. 54, No. 6, 06.2008, p. 607 - 618.

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Harvard

MacQuire, A, Brampton, A, Rai, IA, Race, NJP & Mathy, L 2008, 'Authentication in stealth distributed hash tables', Journal of Systems Architecture, vol. 54, no. 6, pp. 607 - 618. https://doi.org/10.1016/j.sysarc.2008.01.004

APA

MacQuire, A., Brampton, A., Rai, I. A., Race, N. J. P., & Mathy, L. (2008). Authentication in stealth distributed hash tables. Journal of Systems Architecture, 54(6), 607 - 618. https://doi.org/10.1016/j.sysarc.2008.01.004

Vancouver

MacQuire A, Brampton A, Rai IA, Race NJP, Mathy L. Authentication in stealth distributed hash tables. Journal of Systems Architecture. 2008 Jun;54(6):607 - 618. doi: 10.1016/j.sysarc.2008.01.004

Author

MacQuire, Andrew ; Brampton, Andrew ; Rai, Idris A. et al. / Authentication in stealth distributed hash tables. In: Journal of Systems Architecture. 2008 ; Vol. 54, No. 6. pp. 607 - 618.

Bibtex

@article{4baaea623f874c9f9729acfb52a0e6e4,
title = "Authentication in stealth distributed hash tables",
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.",
keywords = "Distributed hash table, Peer-to-peer, Security, Public key infrastructure, Stealth DHT",
author = "Andrew MacQuire and Andrew Brampton and Rai, {Idris A.} and Race, {Nicholas J.P.} and Laurent Mathy",
note = "Selection of best papers from the 32nd EUROMICRO Conference on ˜Software Engineering and Advanced Applications{"} (SEAA 2006)",
year = "2008",
month = jun,
doi = "10.1016/j.sysarc.2008.01.004",
language = "English",
volume = "54",
pages = "607 -- 618",
journal = "Journal of Systems Architecture",
issn = "1383-7621",
publisher = "Elsevier Science B.V.",
number = "6",

}

RIS

TY - JOUR

T1 - Authentication in stealth distributed hash tables

AU - MacQuire, Andrew

AU - Brampton, Andrew

AU - Rai, Idris A.

AU - Race, Nicholas J.P.

AU - Mathy, Laurent

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

PY - 2008/6

Y1 - 2008/6

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

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

KW - Distributed hash table

KW - Peer-to-peer

KW - Security

KW - Public key infrastructure

KW - Stealth DHT

U2 - 10.1016/j.sysarc.2008.01.004

DO - 10.1016/j.sysarc.2008.01.004

M3 - Journal article

VL - 54

SP - 607

EP - 618

JO - Journal of Systems Architecture

JF - Journal of Systems Architecture

SN - 1383-7621

IS - 6

ER -