Noise Reduction for Pufferfish Privacy: A Practical Noise Calibration Method
About
This paper introduces a relaxed noise calibration method to enhance data utility while attaining pufferfish privacy. This work builds on the existing $1$-Wasserstein (Kantorovich) mechanism by alleviating the existing overly strict condition that leads to excessive noise, and proposes a practical mechanism design algorithm as a general solution. We prove that a strict noise reduction by our approach always exists compared to $1$-Wasserstein mechanism for all privacy budgets $\epsilon$ and prior beliefs, and the noise reduction (also represents improvement on data utility) gains increase significantly for low privacy budget situations--which are commonly seen in real-world deployments. We also analyze the variation and optimality of the noise reduction with different prior distributions. Moreover, all the properties of the noise reduction still exist in the worst-case $1$-Wasserstein mechanism we introduced, when the additive noise is largest. We further show that the worst-case $1$-Wasserstein mechanism is equivalent to the $\ell_1$-sensitivity method. Experimental results on three real-world datasets demonstrate $47\%$ to $87\%$ improvement in data utility.
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Noise calibration for Pufferfish privacy | Simulation Figure 2b (test) | Theta (eps=0.1)0.78 | 3 | |
| Noise calibration for Pufferfish privacy | Simulation (test) | Theta (eps=0.1)10 | 3 | |
| Noise calibration for Pufferfish privacy | Student Performance (test) | Theta (eps=0.1)3.39 | 3 | |
| Noise calibration for Pufferfish privacy | Census Income (test) | Theta (e=0.1)10 | 3 | |
| Noise calibration for Pufferfish privacy | Bank Marketing (test) | Theta (Epsilon=0.1)2.53 | 3 |