mlsanityData to 7 Oct 2026

The Bounded Laplace Mechanism in Differential Privacy

arXiv 1808.10410 ↗First posted 30 Aug 2018cs.CRcited by 13

Not on the map. Why?

Abstract (arXiv)

The Laplace mechanism is the workhorse of differential privacy, applied to many instances where numerical data is processed. However, the Laplace mechanism can return semantically impossible values, such as negative counts, due to its infinite support. There are two popular solutions to this: (i) bounding/capping the output values and (ii) bounding the mechanism support. In this paper, we show that bounding the mechanism support, while using the parameters of the pure Laplace mechanism, does not typically preserve differential privacy. We also present a robust method to compute the optimal mechanism parameters to achieve differential privacy in such a setting.

Key facts. Cited by 13 papers in the map (data through 7 Oct 2026). First posted on arXiv 30 Aug 2018.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 2; 2022: 2; 2023: 4; 2024: 3; 2025: 1; 2026: 1.

13 papers.

Sort: