The optimal upper bound of the number of queries for Laplace mechanism under differential privacy

DOI10.1016/J.INS.2019.07.001MaRDI QIDQ2224923zbMATH OpenOpenAlexWikidataFDO

Authors Xiaoguang Li, Hui Li, Hui Zhu, Muyang Huang

Publication date 4 February 2021

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ins.2019.07.001

zbMATH Keywords

differential privacyinformation theoryLaplace mechanismlinear query functionmost aggressive linear queryupper bound for the number of queries

Mathematics Subject Classification ID

Privacy of data (68P27) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Recommendations

• Near-optimal differentially private mechanism for linear queries
• Optimizing Batch Linear Queries under Exact and Approximate Differential Privacy
• Differential privacy and the fat-shattering dimension of linear queries
• Differentially private data releasing for smooth queries
• On the geometry of differential privacy

Cites work

• A Mathematical Theory of Communication
• Blackbox and derivative-free optimization: theory, algorithms and applications
• Differential Privacy
• scientific article; zbMATH DE number 5485439 (Why is no real title available?)
• scientific article; zbMATH DE number 5196663 (Why is no real title available?)
• Optimal Schemes for Discrete Distribution Estimation Under Locally Differential Privacy
• Our Data, Ourselves: Privacy Via Distributed Noise Generation
• The Optimal Noise-Adding Mechanism in Differential Privacy
• Theory of Cryptography

Cited in

(8)

• Lower bounds on the error of query sets under the differentially-private matrix mechanism
• Answering n^2+o(1) counting queries with differential privacy is hard
• Make Up Your Mind: The Price of Online Queries in Differential Privacy
• Near-optimal differentially private mechanism for linear queries
• DP-STGAT: traffic statistics publishing with differential privacy and a spatial-temporal graph attention network
• Multidimensional grid-based clustering with local differential privacy
• Stochastic privacy-preserving methods for nonconvex sparse learning
• Dual-differential privacy-preserving under switching control: a novel approach to improve privacy

Describes a project that uses

Uses Software

• PrivateLR
• UCI

This page was built for publication: The optimal upper bound of the number of queries for Laplace mechanism under differential privacy

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