• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Parallel and Distributed Systems >ReDS: A Framework for Reputation-Enhanced DHTs
【24h】

ReDS: A Framework for Reputation-Enhanced DHTs

机译：ReDS：信誉增强DHT的框架

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Distributed hash tables (DHTs), such as Chord and Kademlia, offer an efficient means to locate resources in peer-to-peer networks. Unfortunately, malicious nodes on 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 redundant lookup queries. Much greater assurance can be provided; we present 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, and 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 percent 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.
机译：诸如Chord和Kademlia之类的分布式哈希表（DHT）提供了一种在对等网络中定位资源的有效方法。不幸的是，查找路径上的恶意节点可以轻松颠覆此类查询。包括Halo（基于Chord）和Kad（基于Kademlia）在内的多个系统通过使用冗余查找查询来缓解此类攻击。可以提供更大的保证；我们介绍了目录服务信誉（ReDS），这是一个通过跟踪其他节点对查询请求的服务程度来增强冗余DHT中的查询的框架。我们描述了ReDS技术如何应用​​于几乎所有冗余的DHT，包括Halo和Kad。我们还研究了不依赖信誉分数共享的方式来协作识别和消除不良查找路径，并且我们证明了这种共享易受攻击的攻击，这使其不适合大多数ReDS应用程序。通过广泛的模拟，我们证明ReDS在各种条件下都可以使Halo和Kad的查找成功率提高80％或更多，甚至是针对试图利用其声誉得分和节点流失的战略攻击者。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号