Optimum Noise Mechanism for Differentially Private Queries in Discrete Finite Sets
Sachin Kadam, Anna Scaglione, Nikhil Ravi, Sean Peisert, Brent, Lunghino, Aram Shumavon

TL;DR
This paper introduces an optimal noise mechanism for discrete differential privacy queries, focusing on minimizing distortion while satisfying privacy constraints, and provides both MILP-based and closed-form solutions.
Contribution
It develops a novel framework for designing optimal noise PMFs for discrete queries, improving accuracy and utility under $(psilon,elta)$ privacy constraints.
Findings
Optimal PMF can be obtained via MILP.
Closed-form solutions provided for specific cases.
Numerical results show superior performance over existing methods.
Abstract
The Differential Privacy (DP) literature often centers on meeting privacy constraints by introducing noise to the query, typically using a pre-specified parametric distribution model with one or two degrees of freedom. However, this emphasis tends to neglect the crucial considerations of response accuracy and utility, especially in the context of categorical or discrete numerical database queries, where the parameters defining the noise distribution are finite and could be chosen optimally. This paper addresses this gap by introducing a novel framework for designing an optimal noise Probability Mass Function (PMF) tailored to discrete and finite query sets. Our approach considers the modulo summation of random noise as the DP mechanism, aiming to present a tractable solution that not only satisfies privacy constraints but also minimizes query distortion. Unlike existing approaches…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCryptography and Data Security · Complexity and Algorithms in Graphs · Logic, Reasoning, and Knowledge
