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

DOI10.1016/J.INS.2019.07.001zbMath1453.68072OpenAlexW2955636524WikidataQ127566756 ScholiaQ127566756MaRDI QIDQ2224923

Xiaoguang Li, Hui Zhu, Hui Li, 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

information theorydifferential privacyLaplace mechanismlinear query functionmost aggressive linear queryupper bound for the number of queries

Mathematics Subject Classification ID

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

Related Items (3)

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

Uses Software

• UCI-ml
• PrivateLR

Cites Work

• Unnamed Item
• Unnamed Item
• A Mathematical Theory of Communication
• Blackbox and derivative-free optimization: theory, algorithms and applications
• The Optimal Noise-Adding Mechanism in Differential Privacy
• Our Data, Ourselves: Privacy Via Distributed Noise Generation
• Optimal Schemes for Discrete Distribution Estimation Under Locally Differential Privacy
• Theory of Cryptography
• Differential Privacy

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