ReDS:声誉增强型DHT的框架
ReDS: A Framework for Reputation-Enhanced DHTs
摘要:
分布式哈希表(DHT),如Chord和Kademlia,为对等网络中的资源定位提供了有效的解决方案。不幸的是,沿着查找路径的恶意节点可以很容易地破坏这样的查询。一些系统,包括Halo(基于Chord)和Kad(基于Kademlia),通过在冗余查找查询所采用的路径中使用冗余和多样性的组合来减轻此类攻击。然而,可以提供更大的保证。我们描述的声誉目录服务(ReDS),一个框架,用于增强查找冗余的DHT跟踪其他节点如何服务查找请求。我们描述了如何Reds技术可以应用到几乎任何冗余的DHT,包括光环和Kad。我们还研究了协作识别和删除坏的查找路径的方式,不依赖于共享的声誉分数-我们表明,这种共享是容易受到攻击,使其不适合大多数应用程序的红色。通过大量的模拟,我们证明了ReDS在各种条件下将Halo和Kad的查找成功率提高了80%或更多,即使是在节点流失的情况下,也可以对抗试图利用其声誉得分的战略攻击者。
英文摘要:
Distributed Hash Tables (DHTs) such as Chord and Kademlia offer an efficient solution for locating resources in peer-to-peer networks. Unfortunately, malicious nodes along a lookup path can easily subvert such queries. Several systems, including Halo (based on Chord) and Kad (based on Kademlia), mitigate such attacks by using a combination of redundancy and diversity in the paths taken by redundant lookup queries. Much greater assurance can be provided, however. We describe Reputation for Directory Services (ReDS), a framework for enhancing lookups in redundant DHTs by tracking how well other nodes service lookup requests. We describe how the ReDS technique can be applied to virtually any redundant DHT including Halo and Kad. We also study the collaborative identification and removal of bad lookup paths in a way that does not rely on the sharing of reputation scores --- we show that such sharing is vulnerable to attacks that make it unsuitable for most applications of ReDS. Through extensive simulations we demonstrate that ReDS improves lookup success rates for Halo and Kad by 80% or more over a wide range of conditions, even against strategic attackers attempting to game their reputation scores and in the presence of node churn.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。