Riffle: An Efficient Communication System With Strong Anonymity
Open accessThe DOI matches its Crossref record; 53 of the 56 references it cites were found in a registry or an index.
Abstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Figures










Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“Khodak et al. [270] and Jiang et al. [250] explore the connection between FL and MAML, and show how the MAML setting is a relevant framework to model the personalization objectives for FL.”
From Advances and Open Problems in Federated Learning (2021) · cites this paper as [270]
Experimental — accuracy not yet measuredThe check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“Several challenging FL topics including personalization and privacy have begun to be studied in this multi-task/LTL framework [270, 250, 299].”
From Advances and Open Problems in Federated Learning (2021) · cites this paper as [270]
Experimental — accuracy not yet measured
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713
Untraceable electronic mail, return addresses, and digital pseudonyms
Chaum, D. L. (1981) · Communications of the ACM · doi:10.1145/358549.358563 · Cited by 4,289 · cited 1×
“However, such systems are susceptible to traffic analysis attacks [36, 43] by powerful adversaries such as an authoritarian government or a state controlled ISP, and have recently been attacked by even weaker adversaries monitoring only the users’ traffic [14, 32, 39, 51].”
Tor: The Second-Generation Onion Router
Dingledine, R., Mathewson, N., & Syverson, P. (2004) · doi:10.21236/ada465464 · Cited by 4,104 · cited 1×
“The right to remain anonymous is a fundamental right in a democratic society and is crucial for freedom of speech [49].”
Chor, B., Kushilevitz, E., Goldreich, O., & Sudan, M. (1998) · Journal of the ACM · doi:10.1145/293347.293350 · Cited by 1,612
Keying Hash Functions for Message Authentication
Bellare, M., Canetti, R., & Krawczyk, H. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68697-5_1 · Cited by 1,580 · cited 1×
“A client only uploads a ciphertext of layered authenticated encryption of size b + mλ, where b is the size of the message, m is the number of servers, and λ is the size of the message authentication codes (MACs) [8] used with the authenticated encryption [9].”
MethodThe dining cryptographers problem: Unconditional sender and recipient untraceability
Chaum, D. (1988) · Journal of Cryptology · doi:10.1007/bf00206326 · Cited by 1,408 · cited 1×
“In this section, we describe related work, focusing on the trade-offs made by existing anonymity systems.”
BackgroundWallet Databases with Observers
Chaum, D., & Pedersen, T. P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48071-4_7 · Cited by 1,292 · cited 2×
“We used ElGamal encryption using Curve25519 [11] and Neff’s shuffle [37] with Chaum-Pederson proofs [17] for the verifiable shuffle and decryption.”
MethodProbabilistic encryption & how to play mental poker keeping secret all partial information
Goldwasser, S., & Micali, S. (1982) · Proceedings of the fourteenth annual ACM symposium on Theory of computing - STOC '82 · doi:10.1145/800070.802212 · Cited by 883 · cited 1×
“To show zero-knowledge, let us assume that the encryption scheme is semantically secure [31], as assumed by [9].”
BackgroundAuthenticated Encryption: Relations among Notions and Analysis of the Generic Composition Paradigm
Bellare, M., & Namprempre, C. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44448-3_41 · Cited by 879
Curve25519: New Diffie-Hellman speed records
Bernstein, D. J. (2006) · Lecture Notes in Computer Science · doi:10.1007/11745853_14 · Cited by 859 · cited 1×
“We used ElGamal encryption using Curve25519 [11] and Neff’s shuffle [37] with Chaum-Pederson proofs [17] for the verifiable shuffle and decryption.”
Research works printed but not linked: 2
- [11]11. D. J. Bernstein. New stream cipher designs. chapter The Salsa20 Family of Stream Ciphers, pages 84-97. Springer- Verlag, Berlin, Heidelberg, 2008.
- [19]19. B. Chor, E. Kushilevitz, O. Goldreich, and M. Sudan. Pri- vate information retrieval. J. ACM, 45(6):965-981, Nov. 1998.
Cited by
Advances and Open Problems in Federated Learning
Kairouz, P., & McMahan, H. B. (2021) · Foundations and Trends in Machine Learning · doi:10.1561/2200000083 · Cited by 7,772
Decentralization in Bitcoin and Ethereum Networks
Gencer, A. E., Basu, S., Eyal, I., van Renesse, R., & Sirer, E. G. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-58387-6_24 · Cited by 374
Distributed Differential Privacy via Shuffling
Cheu, A., Smith, A., Ullman, J., Zeber, D., & Zhilyaev, M. (2019) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-17653-2_13 · Cited by 268
“, [22, 5] and citations therein).”
PIR with Compressed Queries and Amortized Query Processing
Angel, S., Chen, H., Laine, K., & Setty, S. (2018) · 2018 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp.2018.00062 · Cited by 251
SPIRAL: Fast, High-Rate Single-Server PIR via FHE Composition
Menon, S. J., & Wu, D. J. (2022) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp46214.2022.9833700 · Cited by 175
Metadata
- Authors
- Kwon, A., Lazar, D., Devadas, S., & Ford, B.
- Affiliations
- Massachusetts Institute of Technology (US)
- École Polytechnique Fédérale de Lausanne (CH)
- Venue
- Proceedings on Privacy Enhancing Technologies
- Published
- 2015-12-30
- Volume
- 2016
- Issue
- 2
- Pages
- 115-134
- ISSN
- 2299-0984 (ISSN-L)
- OpenAlex
- W2211872228
- Cited by
- 84
- References
- 56
- Citations by year
- 2026: 6 · 2025: 6 · 2024: 10 · 2023: 5 · 2022: 13 · 2021: 9 · 2020: 11 · 2019: 6 · 2018: 9 · 2017: 5 · 2016: 3 · 2015: 1
- FWCI
- 5.89
- Type
- journal article
- Language
- en
- Open access
- hybrid
- doi.org
- Licence
- Locations
- Proceedings on Privacy Enhancing Technologies (publishedVersion, cc-by-nc-nd)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion)
- DSpace@MIT (Massachusetts Institute of Technology) (submittedVersion, cc-by-nc-nd)
- Infoscience (Ecole Polytechnique Fédérale de Lausanne) (submittedVersion, cc-by-nc-nd)
- Funders
- National Science Foundation (1413920)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Internet Traffic Analysis and Secure E-voting
- Physical Sciences › Computer Science › Computer Networks and Communications › Cryptography and Data Security
- Physical Sciences › Computer Science › Computer Networks and Communications › Advanced Authentication Protocols Security
- Keywords
- anonymous communication, private information retrieval, traffic analysis attacks, onion routing, spectral efficiency, computational efficiency, file sharing, microblogging, riffles
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Riffle: An Efficient Communication System With Strong Anonymity. https://app.cochat.ai/papers/10.1515/popets-2016-0008
- The paper
- Kwon, A., Lazar, D., Devadas, S., & Ford, B. (2016). Riffle: An Efficient Communication System With Strong Anonymity. Proceedings on Privacy Enhancing Technologies. https://doi.org/10.1515/popets-2016-0008
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.