Meeting Utility Constraints in Differential Privacy: A Privacy-Boosting Approach
Bo Jiang, Wanrong Zhang, Donghang Lu, Jian Du, Sagar Sharma, Qiang Yan
TL;DR
This paper introduces PB-DP, a privacy-boosting framework that reweights the noise distribution of any kernel DP mechanism to increase the probability that outputs lie in a user-defined preferred region while expanding the overall variance to mitigate privacy leakage. By deriving the privacy loss distribution (PLD) and privacy profile, the authors show how PB-DP achieves $(\\epsilon,\\delta)$-DP or $(\\alpha,\\epsilon)$-RDP under data-dependent, data-independent, or fixed utility regions, and extend to local DP with generalized randomized response. The framework supports efficient optimization of the kernel privacy budget and boosting parameter via offline search, with closed-form expressions for three case studies and a general composition accountant showing significant privacy gains under sequential releases. Empirical results on both synthetic setups and real data demonstrate substantial reductions in privacy loss for target utility constraints, particularly when query sensitivity is large relative to the true answer. Overall, PB-DP offers a flexible, practical approach to designing DP mechanisms that meet specific utility requirements without relaxing DP guarantees in many scenarios, though it may be less suited for pure DP settings due to tail behavior.
Abstract
Data engineering often requires accuracy (utility) constraints on results, posing significant challenges in designing differentially private (DP) mechanisms, particularly under stringent privacy parameter $ε$. In this paper, we propose a privacy-boosting framework that is compatible with most noise-adding DP mechanisms. Our framework enhances the likelihood of outputs falling within a preferred subset of the support to meet utility requirements while enlarging the overall variance to reduce privacy leakage. We characterize the privacy loss distribution of our framework and present the privacy profile formulation for $(ε,δ)$-DP and Rényi DP (RDP) guarantees. We study special cases involving data-dependent and data-independent utility formulations. Through extensive experiments, we demonstrate that our framework achieves lower privacy loss than standard DP mechanisms under utility constraints. Notably, our approach is particularly effective in reducing privacy loss with large query sensitivity relative to the true answer, offering a more practical and flexible approach to designing differentially private mechanisms that meet specific utility constraints.
