The optimal upper bound of the number of queries for Laplace mechanism under differential privacy
DOI10.1016/J.INS.2019.07.001zbMATH Open1453.68072OpenAlexW2955636524WikidataQ127566756 ScholiaQ127566756MaRDI QIDQ2224923FDOQ2224923
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
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
information theorydifferential privacyLaplace mechanismlinear query functionmost aggressive linear queryupper bound for the number of queries
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Privacy of data (68P27)
Cites Work
- Differential Privacy
- A Mathematical Theory of Communication
- Title not available (Why is that?)
- Theory of Cryptography
- Title not available (Why is that?)
- Our Data, Ourselves: Privacy Via Distributed Noise Generation
- The Optimal Noise-Adding Mechanism in Differential Privacy
- Blackbox and derivative-free optimization: theory, algorithms and applications
- Optimal Schemes for Discrete Distribution Estimation Under Locally Differential Privacy
Cited In (7)
- Lower bounds on the error of query sets under the differentially-private matrix mechanism
- Near-optimal differentially private mechanism for linear queries
- Answering \(n^2+o(1)\) counting queries with differential privacy is hard
- 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
- Make Up Your Mind: The Price of Online Queries in Differential Privacy
Uses Software
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)
