.png){kind=icon}
.png){kind=icon}
Return
Authentication in stealth distributed hash tables
.png){kind=icon}
OA
AI
DOI：10.1016/j.sysarc.2008.01.004.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (C) 2008 Elsevier B.V. All rights reserved.
Keywords:
distributed hash table
peer-to-peer
security
public key infrastructure
stealth DHT
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.1
Papers:
3.0K
Citations:
4.2K