Beyond Statistical Estimation: Differentially Private Individual Computation via Shuffling
Not on the map. Why?
Abstract (arXiv)
In data-driven applications, preserving user privacy while enabling valuable computations remains a critical challenge. Technologies like differential privacy have been pivotal in addressing these concerns. The shuffle model of DP requires no trusted curators and can achieve high utility by leveraging the privacy amplification effect yielded from shuffling. These benefits have led to significant interest in the shuffle model. However, the computation tasks in the shuffle model are limited to statistical estimation, making it inapplicable to real-world scenarios in which each user requires a personalized output. This paper introduces a novel paradigm termed Private Individual Computation (PIC), expanding the shuffle model to support a broader range of permutation-equivariant computations. PIC enables personalized outputs while preserving privacy, and enjoys privacy amplification through shuffling. We propose a concrete protocol that realizes PIC. By using one-time public keys, our protocol enables users to receive their outputs without compromising anonymity, which is essential for privacy amplification. Additionally, we present an optimal randomizer, the Minkowski Response, designed for the PIC model to enhance utility. We formally prove the security and privacy properties of the PIC protocol. Theoretical analysis and empirical evaluations demonstrate PIC's capability in handling non-statistical computation tasks, and the efficacy of PIC and the Minkowski randomizer in achieving superior utility compared to existing solutions.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 27 of its 105 references that are in the map. First posted on arXiv 26 Jun 2024.
Builds on
27 of 105 references.
References · 27
- 2014RAPPOR: Randomized Aggregatable Privacy-Preserving Ordinal Responsecited by 262
- 2018Amplification by Shuffling: From Local to Central Differential Privacy via Anonymitycited by 163
- 2017Collecting Telemetry Data Privatelycited by 147
- 2018Protection Against Reconstruction and Its Applications in Private Federated Learningcited by 127
- 2018Distributed Differential Privacy via Shufflingcited by 115
- 2016Minimax Optimal Procedures for Locally Private Estimationcited by 103
- 2020Hiding Among the Clones: A Simple and Nearly Optimal Analysis of Privacy Amplification by Shufflingcited by 96
- 2019The Privacy Blanket of the Shuffle Modelcited by 73
- 2020Breaking the Communication-Privacy-Accuracy Trilemmacited by 68
- 2019Collecting and Analyzing Multidimensional Data with Local Differential Privacycited by 46
- 2017Privacy Loss in Apple's Implementation of Differential Privacy on MacOS 10.12cited by 42
- 2022Optimal Algorithms for Mean Estimation under Local Differential Privacycited by 36
15 more
- 2020FedSel: Federated SGD under Local Differential Privacy with Top-k Dimension Selectioncited by 35
- 2020Private Summation in the Multi-Message Shuffle Modelcited by 34
- 2022Stronger Privacy Amplification by Shuffling for R'enyi and Approximate Differential Privacycited by 29
- 2021Lossless Compression of Efficient Private Local Randomizerscited by 27
- 2016Collecting and Analyzing Data from Smart Device Users with Local Differential Privacycited by 25
- 2021Optimal Compression of Locally Differentially Private Mechanismscited by 22
- 2021Differentially Private Aggregation in the Shuffle Model: Almost Central Accuracy in Almost a Single Messagecited by 18
- 2021Private Counting from Anonymous Messages: Near-Optimal Accuracy with Vanishing Communication Overheadcited by 16
- 2019Estimating Numerical Distributions under Local Differential Privacycited by 14
- 2023Fast Optimal Locally Private Mean Estimation via Random Projectionscited by 14
- 2014Double or Nothing: Multiplicative Incentive Mechanisms for Crowdsourcingcited by 11
- 2023Exact Optimality of Communication-Privacy-Utility Tradeoffs in Distributed Mean Estimationcited by 9
- 2020On the Round Complexity of the Shuffle Modelcited by 5
- 2024Private Vector Mean Estimation in the Shuffle Model: Optimal Rates Require Many Messagescited by 5
- 2023Privacy Amplification via Shuffling: Unified, Simplified, and Tightenedcited by 4
Built on by
Citing papers per year: 2025: 1.
1 paper.