On the measurement complexity of differentially private query answering

DOI10.1007/S11432-015-5306-XzbMATH Open1497.94124OpenAlexW2185690170MaRDI QIDQ5046476FDOQ5046476

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

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

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)