Optimal Noise Adding Mechanisms for Approximate Differential Privacy
From MaRDI portal
Abstract: We study the (nearly) optimal mechanisms in -approximate differential privacy for integer-valued query functions and vector-valued (histogram-like) query functions under a utility-maximization/cost-minimization framework. We characterize the tradeoff between and in utility and privacy analysis for histogram-like query functions ( sensitivity), and show that the -differential privacy is a framework not much more general than the -differential privacy and -differential privacy in the context of and cost functions, i.e., minimum expected noise magnitude and noise power. In the same context of and cost functions, we show the near-optimality of uniform noise mechanism and discrete Laplacian mechanism in the high privacy regime (as ). We conclude that in -differential privacy, the optimal noise magnitude and noise power are and , respectively, in the high privacy regime.
Cited in
(6)- Assessing the effectiveness of the noise addition method of preserving confidentiality in the multivariate normal case
- An optimal (, )-differentially private learning of distributed deep fuzzy models
- Bounded privacy-utility monotonicity indicating bounded tradeoff of differential privacy mechanisms
- PAC privacy: automatic privacy measurement and control of data processing
- Infinitely divisible noise in the low privacy regime
- Mathematical comparison of classical and quantum mechanisms in optimization under local differential privacy
This page was built for publication: Optimal Noise Adding Mechanisms for Approximate Differential Privacy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2977016)