USENIX Security2025Top-tier venue
Beyond Statistical Estimation: Differentially Private Individual Computation via Shuffling
Shaowei Wang, Changyu Dong, Xiangfu Song, Jin Li, Zhili Zhou, Di Wang, Han Wu
Abstract
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.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 9c82243c-7ceb-47a7-928a-bdfa99fac678Cited by top-tier papers1
Ask how each one uses itBuilds on23
- Fantastic Four: Honest-Majority Four-Party Secure Computation With Malicious SecurityAnders P. K. Dalskov, Daniel Escudero, Marcel KellerUSENIX Security 2021 · 174 citations
- Is Interaction Necessary for Distributed Private Learning?Adam D. Smith, Abhradeep Thakurta, Jalaj UpadhyayS&P 2017 · 159 citations
- Breaking the Communication-Privacy-Accuracy TrilemmaWei-Ning Chen, Peter Kairouz, Ayfer ÖzgürNeurIPS 2020 · 144 citations
- Estimating Numerical Distributions under Local Differential PrivacyZitao Li, Tianhao Wang, Milan Lopuhaä-Zwakenberg, Ninghui Li et al.SIGMOD 2020 · 115 citations
- Three Halves Make a Whole? Beating the Half-Gates Lower Bound for Garbled CircuitsMike Rosulek, Lawrence RoyCRYPTO 2021 · 78 citations
Related papers
- FLAME: Differentially Private Federated Learning in the Shuffle ModelRuixuan Liu, Yang Cao, Hong Chen, Ruoyang Guo et al.AAAI 2021 · 117 citations
- Shuffling Is Universal: Statistical Additive Randomized Encodings for All FunctionsNir Bitansky, Saroja Erabelli, Rachit Garg, Yuval IshaiSTOC 2026 · 2 citations
- Private Summation in the Multi-Message Shuffle ModelBorja Balle, James Bell, Adrià Gascón, Kobbi NissimCCS 2020 · 52 citations
- Amplification by Shuffling without ShufflingBorja Balle, James Bell, Adrià GascónCCS 2023
- A Generalized Shuffle Framework for Privacy Amplification: Strengthening Privacy Guarantees and Enhancing UtilityE. Chen, Yang Cao, Yifei GeAAAI 2024 · 16 citations
