Pith. sign in

REVIEW 1 cited by

A closed form scale bound for the (ε, δ)-differentially private Gaussian Mechanism valid for all privacy regimes

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2012.10523 v2 pith:FUQNQP4M submitted 2020-12-18 cs.CR stat.ML

A closed form scale bound for the $(\epsilon, \delta)$-differentially private Gaussian Mechanism valid for all privacy regimes

classification cs.CR stat.ML
keywords deltaepsilonsqrtboundsigmaclosedformprivacy
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
abstract

The standard closed form lower bound on $\sigma$ for providing $(\epsilon, \delta)$-differential privacy by adding zero mean Gaussian noise with variance $\sigma^2$ is $\sigma > \Delta\sqrt {2}(\epsilon^{-1}) \sqrt {\log \left( 5/4\delta^{-1} \right)}$ for $\epsilon \in (0,1)$. We present a similar closed form bound $\sigma \geq \Delta (\epsilon\sqrt{2})^{-1} \left(\sqrt{az+\epsilon} + s\sqrt{az}\right)$ for $z=-\log(4\delta(1-\delta))$ and $(a,s)=(1,1)$ if $\delta \leq 1/2$ and $(a,s)=(\pi/4,-1)$ otherwise. Our bound is valid for all $\epsilon > 0$ and is always lower (better). We also present a sufficient condition for $(\epsilon, \delta)$-differential privacy when adding noise distributed according to even and log-concave densities supported everywhere.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Minimax optimal differentially private synthetic data for smooth queries

    math.ST 2026-02 conditional novelty 7.0

    The minimax error for (epsilon,delta)-differentially private synthetic data under k-smooth queries on the d-cube is (n·epsilon)^(-min{1,k/d}) up to log factors, attained by noisy Chebyshev moment matching and matched ...