Pith. sign in

REVIEW 1 cited by

The Discrete Gaussian for Differential Privacy

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 2004.00010 v6 pith:3DK6LTXP submitted 2020-03-31 cs.DS cs.CRstat.ML

classification cs.DScs.CRstat.ML
keywords gaussiancontinuousdiscretenoiseprivacyaddingdifferentialdistribution
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

A key tool for building differentially private systems is adding Gaussian noise to the output of a function evaluated on a sensitive dataset. Unfortunately, using a continuous distribution presents several practical challenges. First and foremost, finite computers cannot exactly represent samples from continuous distributions, and previous work has demonstrated that seemingly innocuous numerical errors can entirely destroy privacy. Moreover, when the underlying data is itself discrete (e.g., population counts), adding continuous noise makes the result less interpretable. With these shortcomings in mind, we introduce and analyze the discrete Gaussian in the context of differential privacy. Specifically, we theoretically and experimentally show that adding discrete Gaussian noise provides essentially the same privacy and accuracy guarantees as the addition of continuous Gaussian noise. We also present an simple and efficient algorithm for exact sampling from this distribution. This demonstrates its applicability for privately answering counting queries, or more generally, low-sensitivity integer-valued queries.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Free Privacy Protection for Wireless Federated Learning: Enjoy It or Suffer from It?

    cs.LG 2025-06 reject novelty 6.0 of 10

    A bit-flipping mechanism for wireless federated learning claims Rényi differential privacy from channel noise, but the proof uses an expected bit-level distance rather than a worst-case sensitivity, leaving the guaran...

Pith tools