Authentication in Stealth Distributed Hash Tables

MacQuire, Andrew; Brampton, Andrew; Rai, Idris; Race, Nicholas; Mathy, Laurent

doi:10.1109/euromicro.2006.23

Cited by 4 publications

(6 citation statements)

References 36 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Certificates of promoted nodes are sent to all nodes using promotion message, which is sent during node's promotion (see Algorithm 1). Therefore, demotion due to contract expiration is simply equivalent to certificate revocation mechanism in PKI ( see [4]). Essentially, it involves all nodes on the network (service nodes and other promoted nodes) that have the ID of the node to be demoted in their routing tables to simply remove the nodes' IDs from their routing tables whenever their certificates expire.…”

Section: Nodes Demotionmentioning

confidence: 99%

“…This is achieved by simply sending a registration message towards their own ID. The registration process should include authentication and certification process that were proposed in [4].…”

Section: Promotion In Stealth Dhtmentioning

confidence: 99%

“…Additional benefit of Stealth DHT is that the lack of announcement messages cuts the overhead of joining stealth nodes significantly. Security enhancement mechanisms for Stealth DHT are proposed in [4], performance of stealth DHT in mobile networks is analyzed in [11], and performance models of DHT routing protocol are derived in [12].…”

Section: Related Workmentioning

confidence: 99%

“…Recall that in our proposal, the promotion mechanism starts with registration process (Refer to Section III-A and in the Algorithm 1). The registration process ( initially proposed in [4]) uses Public Key Infrastructure (PKI) to issue certificates to nodes, which will contain expiration date of the agreement among other nodes particulars. Certificates of promoted nodes are sent to all nodes using promotion message, which is sent during node's promotion (see Algorithm 1).…”

Section: Nodes Demotionmentioning

confidence: 99%

“…This has led to peer-to-peer service providers in some countries such as US to be liable for illegal activity in their networks [2]. Table (Stealth DHT) was proposed to address the aforementioned DHT problems [3], [4]. Stealth DHT offers an elegant technique to enable the use of super-peers in the majority of DHT-based networks while avoiding the deficiencies of previous super-peers approaches [5], [6], such as a single point of failure.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

A Promotion Mechanism for Scalable Stealth DHT

Idris

2010

2010 Fifth International Conference on Internet and Web Applications and Services

View full text Add to dashboard Cite

Most Distributed Hash Tables (DHTs) inherently assume interconnecting nodes with homogeneous capabilities. Realistically however, capabilities of nodes on a network widely vary, leading traditional DHTs to inevitably exhibit poor performance in real-world environments. Stealth DHT was previously proposed to address node heterogeneity by enabling a DHT to separate highly capable (super-peers or service) nodes from less capable (stealth) nodes. Stealth DHTs are considered robust and flexible due to the way they organize nodes on the network. However, it is difficult to overprovision the number of service nodes to support unexpected increase in user requests in the networks. Unlike traditional DHTs therefore, Stealth DHTs cannot guarantee network scalability. In this paper, we address this problem by proposing a simple promotion mechanism to extend Stealth DHT to use stealth nodes as back-up resources that it can use when the network is overloaded. We define promotion of stealth nodes as the act of enabling stealth nodes execute some or all of the operations of service nodes. Experiments results show that the proposed promotion mechanism can offload significant proportion of network load.

show abstract

Section: Nodes Demotionmentioning

confidence: 99%

“…This is achieved by simply sending a registration message towards their own ID. The registration process should include authentication and certification process that were proposed in [4].…”

Section: Promotion In Stealth Dhtmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Nodes Demotionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

A Promotion Mechanism for Scalable Stealth DHT

Idris

2010

2010 Fifth International Conference on Internet and Web Applications and Services

View full text Add to dashboard Cite

show abstract

Distributed Ledgers in Developing Large-Scale Integrated Systems

Marchini

2021

2021 IEEE International Systems Conference (SysCon)

View full text Add to dashboard Cite

Stealth distributed hash table

Brampton

MacQuire

Idris

et al. 2006

Proceedings of the 2006 ACM CoNEXT Conference on - CoNEXT '06

View full text Add to dashboard Cite

Most Distributed Hash Tables (DHTs) simply consider interconnecting homogeneous nodes on the same overlay. However, realistically nodes on a network are heterogeneous in terms of their capabilities. Because of this, traditional DHTs have been shown to exhibit poor performance in a real-world environment. Additionally, we believe that it is this approach that contributes to a limited exploitation of peer-to-peer technologies. Previous work on super-peers in DHTs was proposed to address these performance issues, however the strategy used is often based on locally clustering peers around individual super-peers. This method of superpeering, however, compromises fundamental features such as load-balancing, resilience and routing efficiency, which traditional DHTs originally promised to offer. We propose a Stealth DHT which addresses the deficiencies of previous super-peer approaches by using the DHT algorithm itself to select the most appropriate super-peer for each message sent by peers. Through simulations and measurements, we show the fitness for purpose of our proposal.

show abstract

Authentication in Stealth Distributed Hash Tables

Cited by 4 publications

References 36 publications

A Promotion Mechanism for Scalable Stealth DHT

A Promotion Mechanism for Scalable Stealth DHT

Distributed Ledgers in Developing Large-Scale Integrated Systems

Stealth distributed hash table

Contact Info

Product

Resources

About