Near-optimal differentially private mechanism for linear queries

DOI10.13328/J.CNKI.JOS.005184zbMATH Open1399.68043MaRDI QIDQ4640976FDOQ4640976

Authors: Genqiang Wu, Yeping He, Xianyao Xia 

Publication date: 25 May 2018

Recommendations

• A differentially private mechanism of optimal utility for a region of priors
• Universally utility-maximizing privacy mechanisms
• Universally utility-maximizing privacy mechanisms
• The optimal upper bound of the number of queries for Laplace mechanism under differential privacy
• An improved private mechanism for small databases

zbMATH Keywords

multi-objective optimizationdifferential privacylinear queryoptimal mechanismnon-sensitivity method

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Multi-objective and goal programming (90C29) Data encryption (aspects in computer science) (68P25)

Cited In (9)

• A differentially private mechanism of optimal utility for a region of priors
• Towards Instance-Optimal Private Query Release
• Optimizing Batch Linear Queries under Exact and Approximate Differential Privacy
• Lower bounds on the error of query sets under the differentially-private matrix mechanism
• Differential privacy and the fat-shattering dimension of linear queries
• Answering \(n^2+o(1)\) counting queries with differential privacy is hard
• The optimal upper bound of the number of queries for Laplace mechanism under differential privacy
• On the optimality of the exponential mechanism
• Make Up Your Mind: The Price of Online Queries in Differential Privacy

This page was built for publication: Near-optimal differentially private mechanism for linear queries

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