Not All Attributes are Created Equal: $d_{\mathcal{X}}$-Private Mechanisms for Linear Queries
Parameswaran Kamalaruban, Victor Perrier, Hassan Jameel Asghar, and Mohamed Ali Kaafar

TL;DR
This paper introduces a flexible privacy framework called $d_{\mathcal{X}}$-privacy that allows different privacy levels for different data attributes, improving utility in linear query analysis.
Contribution
It presents a systematic method to adapt existing differential privacy mechanisms to $d_{\mathcal{X}}$-privacy, enabling attribute-specific privacy guarantees for linear queries.
Findings
The proposed $d_{\mathcal{X}}$-private Laplace mechanism improves privacy-utility tradeoff.
Theoretical guarantees support the effectiveness of the method.
Experimental results on synthetic and real data validate the approach.
Abstract
Differential privacy provides strong privacy guarantees simultaneously enabling useful insights from sensitive datasets. However, it provides the same level of protection for all elements (individuals and attributes) in the data. There are practical scenarios where some data attributes need more/less protection than others. In this paper, we consider -privacy, an instantiation of the privacy notion introduced in \cite{chatzikokolakis2013broadening}, which allows this flexibility by specifying a separate privacy budget for each pair of elements in the data domain. We describe a systematic procedure to tailor any existing differentially private mechanism that assumes a query set and a sensitivity vector as input into its -private variant, specifically focusing on linear queries. Our proposed meta procedure has broad applications as linear queries form the…
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
TopicsPrivacy-Preserving Technologies in Data · Cryptography and Data Security · Complexity and Algorithms in Graphs
