Riffle: An Efficient Communication System With Strong Anonymity
Author(s)
Kwon, Albert Hyukjae; Lazar, David; Devadas, Srinivas; Ford, Bryan![Thumbnail](/bitstream/handle/1721.1/128773/%5b22990984%20-%20Proceedings%20on%20Privacy%20Enhancing%20Technologies%5d%20Riffle.pdf.jpg?sequence=4&isAllowed=y)
DownloadPublished version (2.084Mb)
Terms of use
Metadata
Show full item recordAbstract
Existing anonymity systems sacrifice anonymity for efficient communication or vice-versa. Onion-routing achieves low latency, high bandwidth, and scalable anonymous communication, but is susceptible to traffic analysis attacks. Designs based on DC-Nets, on the other hand, protect the users against traffic analysis attacks, but sacrifice bandwidth. Verifiable mixnets maintain strong anonymity with low bandwidth overhead, but suffer from high computation overhead instead. In this paper, we present Riffle, a bandwidth and computation efficient communication system with strong anonymity. Riffle consists of a small set of anonymity servers and a large number of users, and guarantees anonymity among all honest clients as long as there exists at least one honest server. Riffle uses a new hybrid verifiable shuffle technique and private information retrieval for bandwidth- and computation-efficient anonymous communication. Our evaluation of Riffle in file sharing and microblogging applications shows that Riffle can achieve a bandwidth of over 100KB/s per user in an anonymity set of 200 users in the case of file sharing, and handle over 100,000 users with less than 10 second latency in the case of microblogging.
Date issued
2015-12Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory; Massachusetts Institute of Technology. Department of Electrical Engineering and Computer ScienceJournal
Proceedings on Privacy Enhancing Technologies
Publisher
Walter de Gruyter GmbH
Citation
Kwon, Albert Hyukjae et al. "Riffle: An Efficient Communication System With Strong Anonymity." Proceedings on Privacy Enhancing Technologies 2016, 2 (April 2016): 115-134
Version: Final published version
ISSN
2299-0984