Differential privacy and epsilon

See the privacy–accuracy trade-off by changing ε in the Laplace mechanism.

IntermediatePrivacy Lab
العربية

The idea

Laplace noise with scale Δ/ε is added to a true count, repeated many times to measure the error.

Data description

Synthetic data generated in your browser from stated distributions; no real personal data.

Suggested next experiment

Concepts in this experiment

What is a good value of epsilon?

There is no universal value. Small values (below 1) give strong guarantees with much noise; large values weaken them. It depends on data sensitivity, number of queries (total budget) and needed accuracy, and should be disclosed.

Laplace mechanism formula

Δf is the query sensitivity (1 for a count); smaller ε means more noise.

M(D)=f(D)+\mathrm{Lap}\!\left(\frac{\Delta f}{\varepsilon}\right),\quad \mathbb{E}|\text{noise}|=\frac{\Delta f}{\varepsilon}
Definition of ε-differential privacy formula

For all datasets D, D′ differing in one person and all output sets S.

P[M(D)\in S]\le e^{\varepsilon}\,P[M(D^\prime)\in S]
Differential privacy

A mathematical guarantee that an analysis's output barely changes when one person is added or removed. Achieved by calibrated noise, e.g. the Laplace mechanism with scale Δ/ε. Smaller ε = stronger privacy, more noise (Dwork & Roth, 2014).

Scientific sources for this experiment

  1. The Algorithmic Foundations of Differential PrivacyC. Dwork, A. Roth (2014) — Paper

More in this module