.png){kind=icon}
返回
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}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
distributed hash table
peer-to-peer
security
public key infrastructure
stealth DHT
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.1
论文数:
3.0K
被引数:
4.2K
机构
引用论文
Polymerization and depolymerization of microtubules in vitro as studied by flow birefringence.png)
FEBS LettersOAAI
FEBS LettersIF0
OAAI分享收藏
分享收藏
查看更多内容