为健壮的DHT添加查询隐私
Adding Query Privacy to Robust DHTs
摘要：
近年来，对分布式哈希表（DHT）上的匿名通信的兴趣有所增加。然而，几乎所有已知的解决方案都只针对在DHT查询中实现发送者或请求者匿名。在许多应用场景中，关键是查询的密钥对中间对等体保持秘密，这些中间对等体（帮助）将查询路由到其目的地。在本文中，我们满足这一要求，提出了一种方法，提供隐私的关键在DHT查询。我们使用不经意传输（OT）的概念，在通信中的DHT保留查询隐私，而不影响垃圾邮件的抵抗。虽然我们的OT为基础的方法可以工作在任何分布式哈希表，我们专注于强大的分布式哈希表，可以容忍拜占庭故障和抵制垃圾邮件的通信。我们选择最知名的强大的DHT建设，并采用一个有效的OT协议非常适合实现我们的目标，获得查询隐私的强大的DHT。最后，我们比较了我们的隐私保护协议的性能与他们的隐私侵犯同行。我们观察到消息复杂度没有增加，计算复杂性只有很小的开销。
英文摘要：
Interest in anonymous communication over distributed hash tables (DHTs) has increased in recent years. However, almost all known solutions solely aim at achieving sender or requestor anonymity in DHT queries. In many application scenarios, it is crucial that the queried key remains secret from intermediate peers that (help to) route the queries towards their destinations. In this paper, we satisfy this requirement by presenting an approach for providing privacy for the keys in DHT queries. We use the concept of oblivious transfer (OT) in communication over DHTs to preserve query privacy without compromising spam resistance. Although our OT-based approach can work over any DHT, we concentrate on communication over robust DHTs that can tolerate Byzantine faults and resist spam. We choose the best-known robust DHT construction, and employ an efficient OT protocol well-suited for achieving our goal of obtaining query privacy over robust DHTs. Finally, we compare the performance of our privacy-preserving protocols with their more privacy-invasive counterparts. We observe that there is no increase in the message complexity and only a small overhead in the computational complexity.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
