RAC: a Freerider-resilient, Scalable, Anonymous Communication Protocol

Citation:
Sonia Ben Mokhtar, Gautier Berthou ADVQ, Shoker A.  2013.  RAC: a Freerider-resilient, Scalable, Anonymous Communication Protocol. Proceedings of the 33rd International Conference on Distributed Computing Systems - ICDCS.

Tertiary Title:

ICDCS'13

Date Presented:

July

Abstract:

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 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.

Citation Key:

shokerRAC2013

DOI:

10.1109/ICDCS.2013.52

PreviewAttachmentSize
Paper377.39 KB