RAC: A Freerider-Resilient, Scalable, Anonymous Communication Protocol
RAC: A Freerider-Resilient, Scalable, Anonymous Communication Protocol
复制标题
RAC：一种具有 Freerider 弹性、可扩展的匿名通信协议
DOI：
10.1109/icdcs.2013.52
复制
发表时间：
2013
期刊：
影响因子：
--
通讯作者：
Ali Shoker
中科院分区：
文献类型：
--
作者：
Sonia Ben Mokhtar;Gautier Berthou;Amadou Diarra;Vivien Quéma;Ali Shoker
在互联网上实现匿名通信至关重要。第一个为匿名通信而设计的协议是受自由乘车的影响。因此，最近提出了处理这一问题的议定书。然而，这些协议不能扩展到大型系统，并且其中一些协议进一步假设可信服务器的存在。在本文中，我们提出RAC，第一个匿名通信协议，容忍自由骑手和规模的大型系统。可伸缩性来自这样一个事实，即RAC的复杂性（就消息交换的数量而言）与系统中的节点数量无关。RAC的另一个重要方面是它不依赖于任何可信的第三方。我们从理论上证明，利用博弈论，我们的协议是一个纳什均衡，即，自由车手没有兴趣偏离协议。此外，我们实验评估RAC使用模拟。我们的评估表明，无论系统的大小（最多100.000个节点），参与系统的节点观察到相同的吞吐量。
Enabling anonymous communication over the Internet is crucial. The first protocols that have been devised for anonymous communication are subject to freeriding. Recent protocols have thus been proposed to deal with this issue. However, these protocols do not scale to large systems, and some of them further assume the existence of trusted servers. In this paper, we present RAC, the first anonymous communication protocol that tolerates freeriders and that scales to large systems. Scalability comes from the fact that the complexity of RAC in terms of the number of message exchanges is independent from the number of nodes in the system. Another important aspect of RAC is that it does not rely on any trusted third party. We theoretically prove, using game theory, that our protocol is a Nash equilibrium, i.e, that freeriders have no interest in deviating from the protocol. Further, we experimentally evaluate RAC using simulations. Our evaluation shows that, whatever the size of the system (up to 100.000 nodes), the nodes participating in the system observe the same throughput.