Pure-DP aggregation in the shuffle model: error-optimal and communication-efficient

DOI10.4230/LIPICS.ITC.2024.4MaRDI QIDQ6864455zbMATH OpenFDO

Authors Badih Ghazi, Ravi Kumar, Pasin Manurangsi

Publication date 3 February 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ITC.2024.4

zbMATH Keywords

aggregationdifferential privacypure differential privacyshuffle model

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• Amplification by shuffling: from local to central differential privacy via anonymity
• Distributed differential privacy via shuffling
• Distributed Private Data Analysis: Simultaneously Solving How and What
• Heavy Hitters and the Structure of Local Privacy
• On the power of multiple anonymous messages: frequency estimation and selection in the shuffle model of differential privacy
• Optimal lower bound for differentially private multi-party aggregation
• Our Data, Ourselves: Privacy Via Distributed Noise Generation
• Private aggregation from fewer anonymous messages
• Pure differentially private summation from anonymous messages
• Separating Local & Shuffled Differential Privacy via Histograms
• The Optimal Noise-Adding Mechanism in Differential Privacy
• The privacy blanket of the shuffle model
• Theory of Cryptography
• Universally utility-maximizing privacy mechanisms

This page was built for publication: Pure-DP aggregation in the shuffle model: error-optimal and communication-efficient

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6864455)