CoChat

Riffle: An Efficient Communication System With Strong Anonymity

Open access
Kwon, Albert, Lazar, David, Devadas, Srinivas, Ford, Bryan · 2016 · Proceedings on Privacy Enhancing Technologies

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

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1515/popets-2016-0008

Cites

53 of 53 references verified0 citation errors · 0 not checkable

Statistics

Figures

Fig. 1 Deployment model of Riffle
Fig. 1 Deployment model of RiffleCC-BY-NC-ND · From the PDF
Image 2
CC-BY-NC-ND · From the PDF
(c) Upload: Each client uploads an encrypted file based on the requests using Riffle.
(c) Upload: Each client uploads an encrypted file based on the requests using Riffle.CC-BY-NC-ND · From the PDF
(d) Download: Each client downloads the file he or she requested using PIR.
(d) Download: Each client downloads the file he or she requested using PIR.CC-BY-NC-ND · From the PDF
Fig. 3 Testbed topology.
Fig. 3 Testbed topology.CC-BY-NC-ND · From the PDF
Image 6
CC-BY-NC-ND · From the PDF
Image 7
CC-BY-NC-ND · From the PDF
Fig. 6 Breakdown of the total time taken to share a 10MB file for varying numbers of clients with 3 servers. Sharing a 10MB file consists of 40 rounds with 256KB blocks.
Fig. 6 Breakdown of the total time taken to share a 10MB file for varying numbers of clients with 3 servers. Sharing a 10MB file consists of 40 rounds with 256KB blocks.CC-BY-NC-ND · From the PDF
Fig. 7 Breakdown of the total time taken to share a 300MB file for varying numbers of clients with 3 servers. Sharing a 300MB file consists of 1200 rounds with 256KB blocks.
Fig. 7 Breakdown of the total time taken to share a 300MB file for varying numbers of clients with 3 servers. Sharing a 300MB file consists of 1200 rounds with 256KB blocks.CC-BY-NC-ND · From the PDF
Fig. 8 Average latency to share a microblogging post for different message sizes. The number of servers here was fixed at 3.
Fig. 8 Average latency to share a microblogging post for different message sizes. The number of servers here was fixed at 3.CC-BY-NC-ND · From the PDF

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.

A few free checks a day · papers already verified open instantly · results are public

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?

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

Show all 53 references

Research works printed but not linked: 2

  1. [11]11. D. J. Bernstein. New stream cipher designs. chapter The Salsa20 Family of Stream Ciphers, pages 84-97. Springer- Verlag, Berlin, Heidelberg, 2008.
  2. [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

See all 84

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