Amplification by Shuffling: From Local to Central Differential Privacy via Anonymity

DOI10.1137/1.9781611975482.151zbMath1432.68133arXiv1811.12469OpenAlexW2950321888MaRDI QIDQ5236340

Kunal Talwar, Ananth Raghunathan, Vitaly Feldman, Úlfar Erlingsson, Ilya Mironov, Abhradeep Thakurta

Publication date: 15 October 2019

Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1811.12469

Mathematics Subject Classification ID

Privacy of data (68P27)

Related Items (11)

Privacy-preserving federated learning on lattice quantization ⋮ A theory of composition for differential obliviousness ⋮ An accurate, scalable and verifiable protocol for federated differentially private averaging ⋮ Approximate distance-comparison-preserving symmetric encryption ⋮ PAC privacy: automatic privacy measurement and control of data processing ⋮ The right complexity measure in locally private estimation: it is not the Fisher information ⋮ Differential privacy: getting more for less ⋮ On the power of multiple anonymous messages: frequency estimation and selection in the shuffle model of differential privacy ⋮ Non-interactive anonymous router ⋮ Spreading the privacy blanket: differentially oblivious shuffling for differential privacy ⋮ Private aggregation from fewer anonymous messages

This page was built for publication: Amplification by Shuffling: From Local to Central Differential Privacy via Anonymity