Unconditional differentially private mechanisms for linear queries

DOI10.1145/2213977.2214089zbMath1286.94059OpenAlexW2167987512MaRDI QIDQ5415549

Aditya Bhaskara, Ravishankar Krishnaswamy, Daniel Dadush, 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

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

Related Items (4)

Lower bounds on the error of query sets under the differentially-private matrix mechanism ⋮ Differentially private range query on shortest paths ⋮ The Geometry of Differential Privacy: The Small Database and Approximate Cases ⋮ The Complexity of Differential Privacy

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