On distributed differential privacy and counting distinct elements

DOI10.4230/LIPICS.ITCS.2021.56MaRDI QIDQ7229345zbMATH OpenFDO

Authors Lijie Chen, Badih Ghazi, Ravi Kumar, Pasin Manurangsi

Publication date 15 April 2026

Copyright license Creative Commons Attribution 3.0 Unported

Full work available at URL https://doi.org/10.4230/LIPICS.ITCS.2021.56

zbMATH Keywords

differential privacyshuffle model

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• Amplification by shuffling: from local to central differential privacy via anonymity
• Analysis of Boolean Functions
• Beyond set disjointness: the communication complexity of finding the intersection
• Chebyshev polynomials, moment matching, and optimal estimation of the unseen
• Distributed differential privacy via shuffling
• Efficient noise-tolerant learning from statistical queries
• Estimating the unseen, improved estimators for entropy and other properties
• Heavy Hitters and the Structure of Local Privacy
• scientific article; zbMATH DE number 7788480 (Why is no real title available?)
• Local privacy and statistical minimax rates
• On the round complexity of the shuffle model
• Optimal lower bound for differentially private multi-party aggregation
• Our Data, Ourselves: Privacy Via Distributed Noise Generation
• Randomized response: a survey technique for eliminating evasive answer bias
• The algorithmic foundations of differential privacy
• The complexity of differential privacy
• The limits of two-party differential privacy
• The power of factorization mechanisms in local and central differential privacy
• The privacy blanket of the shuffle model
• Theory of Cryptography
• Tight lower bounds for differentially private selection
• What can we learn privately?

This page was built for publication: On distributed differential privacy and counting distinct elements

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