On the measurement complexity of differentially private query answering

DOI10.1007/S11432-015-5306-XMaRDI QIDQ5046476zbMATH OpenOpenAlexFDO

Authors

Publication date 28 October 2022

Published in Science China Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11432-015-5306-x

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• Answering \(n^{2+o(1)}\) counting queries with differential privacy is hard
• Improved boosting algorithms using confidence-rated predictions
• Interactive privacy via the median mechanism
• On the complexity of differentially private data release, efficient algorithms and hardness results
• PAC-Bayesian stochastic model selection
• Pion-Nucleon Scattering in the Mandelstam Representation
• Theory of Cryptography
• Tracing traitors
• What can we learn privately?

This page was built for publication: On the measurement complexity of differentially private query answering

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