mlsanityData to 7 Oct 2026

Differentially Private Aggregation in the Shuffle Model: Almost Central Accuracy in Almost a Single Message

arXiv 2109.13158 ↗First posted 27 Sep 2021cs.CR cs.DScited by 18

Not on the map. Why?

Abstract (arXiv)

The shuffle model of differential privacy has attracted attention in the literature due to it being a middle ground between the well-studied central and local models. In this work, we study the problem of summing (aggregating) real numbers or integers, a basic primitive in numerous machine learning tasks, in the shuffle model. We give a protocol achieving error arbitrarily close to that of the (Discrete) Laplace mechanism in the central model, while each user only sends 1 + o(1) short messages in expectation.

Key facts. Cited by 18 papers in the map (data through 7 Oct 2026). First posted on arXiv 27 Sep 2021.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 2; 2022: 5; 2023: 3; 2024: 4; 2025: 2; 2026: 2.

18 papers.

Sort: