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

Authentication in stealth distributed hash tables

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNConference contribution/Paperpeer-review

Published

Standard

Authentication in stealth distributed hash tables. / MacQuire, Andrew; Brampton, Andrew; Rai, Idris et al.
32nd Euromicro Conference on Software Engineering and Advanced Applications, 2006. IEEE, 2006. p. 348-355.

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNConference contribution/Paperpeer-review

Harvard

MacQuire, A, Brampton, A, Rai, I, Race, NJP & Mathy, L 2006, Authentication in stealth distributed hash tables. in 32nd Euromicro Conference on Software Engineering and Advanced Applications, 2006. IEEE, pp. 348-355, 32nd Euromicro Conference on Software Engineering and Advanced Applications, Cavtat/Dubrovnik, Croatia, 28/08/06. https://doi.org/10.1109/EUROMICRO.2006.23

APA

MacQuire, A., Brampton, A., Rai, I., Race, N. J. P., & Mathy, L. (2006). Authentication in stealth distributed hash tables. In 32nd Euromicro Conference on Software Engineering and Advanced Applications, 2006 (pp. 348-355). IEEE. https://doi.org/10.1109/EUROMICRO.2006.23

Vancouver

MacQuire A, Brampton A, Rai I, Race NJP, Mathy L. Authentication in stealth distributed hash tables. In 32nd Euromicro Conference on Software Engineering and Advanced Applications, 2006. IEEE. 2006. p. 348-355 doi: 10.1109/EUROMICRO.2006.23

Author

MacQuire, Andrew ; Brampton, Andrew ; Rai, Idris et al. / Authentication in stealth distributed hash tables. 32nd Euromicro Conference on Software Engineering and Advanced Applications, 2006. IEEE, 2006. pp. 348-355

Bibtex

@inproceedings{86b521a0e25f468a89028e3386bf6b49,
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. 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.",
author = "Andrew MacQuire and Andrew Brampton and Idris Rai and Race, {Nicholas J. P.} and Laurent Mathy",
year = "2006",
month = aug,
day = "28",
doi = "10.1109/EUROMICRO.2006.23",
language = "English",
isbn = "0-7695-2594-6 ",
pages = "348--355",
booktitle = "32nd Euromicro Conference on Software Engineering and Advanced Applications, 2006",
publisher = "IEEE",
note = "32nd Euromicro Conference on Software Engineering and Advanced Applications ; Conference date: 28-08-2006 Through 01-09-2006",

}

RIS

TY - GEN

T1 - Authentication in stealth distributed hash tables

AU - MacQuire, Andrew

AU - Brampton, Andrew

AU - Rai, Idris

AU - Race, Nicholas J. P.

AU - Mathy, Laurent

PY - 2006/8/28

Y1 - 2006/8/28

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

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

U2 - 10.1109/EUROMICRO.2006.23

DO - 10.1109/EUROMICRO.2006.23

M3 - Conference contribution/Paper

SN - 0-7695-2594-6

SP - 348

EP - 355

BT - 32nd Euromicro Conference on Software Engineering and Advanced Applications, 2006

PB - IEEE

T2 - 32nd Euromicro Conference on Software Engineering and Advanced Applications

Y2 - 28 August 2006 through 1 September 2006

ER -