Lower bounds on the error of query sets under the differentially-private matrix mechanism

DOI10.1007/s00224-015-9610-zzbMath1352.68083arXiv1202.3399OpenAlexW1990051990MaRDI QIDQ269340

Gerome Miklau, Chao Li

Publication date: 18 April 2016

Published in: Theory of Computing Systems (Search for Journal in Brave)

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

zbMATH Keywords

lower boundspectral decompositiondifferential privacylinear queryminimal error

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25)

Related Items (1)

Spectrum Approximation Beyond Fast Matrix Multiplication: Algorithms and Hardness

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalized inverses. Theory and applications.
• The Geometry of Differential Privacy: The Small Database and Approximate Cases
• Nearly Optimal Private Convolution
• On the geometry of differential privacy
• Interactive privacy via the median mechanism
• The price of privately releasing contingency tables and the spectra of random matrices with correlated rows
• Iterative Constructions and Private Data Release
• Our Data, Ourselves: Privacy Via Distributed Noise Generation
• Eigenvalues, invariant factors, highest weights, and Schubert calculus
• On the complexity of differentially private data release
• Unconditional differentially private mechanisms for linear queries
• Theory of Cryptography

This page was built for publication: Lower bounds on the error of query sets under the differentially-private matrix mechanism