Unconditional differentially private mechanisms for linear queries

DOI10.1145/2213977.2214089MaRDI QIDQ5415549zbMATH OpenOpenAlexFDO

Authors Aditya Bhaskara, Daniel Dadush, Ravishankar Krishnaswamy, Kunal Talwar

Publication date 13 May 2014

Published in Proceedings of the forty-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2213977.2214089

zbMATH Keywords

differential privacyslicing conjecture

Mathematics Subject Classification ID

Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Cryptography (94A60)

Recommendations

• On the geometry of differential privacy
• An improved private mechanism for small databases
• Lower bounds for differential privacy from Gaussian width

Cited in

(12)

• Unconditionally secure disjointness tests for private datasets
• Efficient algorithms for privately releasing marginals via convex relaxations
• Lower bounds on the error of query sets under the differentially-private matrix mechanism
• On the geometry of differential privacy
• An improved private mechanism for small databases
• Make Up Your Mind: The Price of Online Queries in Differential Privacy
• Lower bounds for differential privacy from Gaussian width
• Using convex relaxations for efficiently and privately releasing marginals (extended abstract)
• Optimizing Batch Linear Queries under Exact and Approximate Differential Privacy
• The complexity of differential privacy
• Differentially private range query on shortest paths
• General Gaussian noise mechanisms and their optimality for unbiased mean estimation

This page was built for publication: Unconditional differentially private mechanisms for linear queries

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