mlsanityData to 14 Oct 2026

Differential privacy for symmetric log-concave mechanisms

arXiv 2202.11393 ↗First posted 23 Feb 2022cs.CR stat.MLcited by 1

Not on the map. Why?

Abstract (arXiv)

Adding random noise to database query results is an important tool for achieving privacy. A challenge is to minimize this noise while still meeting privacy requirements. Recently, a sufficient and necessary condition for (ε, δ)-differential privacy for Gaussian noise was published. This condition allows the computation of the minimum privacy-preserving scale for this distribution. We extend this work and provide a sufficient and necessary condition for (ε, δ)-differential privacy for all symmetric and log-concave noise densities. Our results allow fine-grained tailoring of the noise distribution to the dimensionality of the query result. We demonstrate that this can yield significantly lower mean squared errors than those incurred by the currently used Laplace and Gaussian mechanisms for the same ε and δ.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 8 of its 34 references that are in the map. First posted on arXiv 23 Feb 2022.

Builds on

8 of 34 references.

References · 8

  1. 2016Deep Learning with Differential Privacycited by 2,728
  2. 2017Renyi Differential Privacycited by 650
  3. 2016Concentrated Differential Privacy: Simplifications, Extensions, and Lower Boundscited by 346
  4. 2013The Composition Theorem for Differential Privacycited by 297
  5. 2018Improving the Gaussian Mechanism for Differential Privacy: Analytical Calibration and Optimal Denoisingcited by 218
  6. 2016Concentrated Differential Privacycited by 144
  7. 2020The Discrete Gaussian for Differential Privacycited by 135
  8. 2021A Central Limit Theorem for Differentially Private Query Answeringcited by 7

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.