Data Disclosure with Non-zero Leakage and Non-invertible Leakage Matrix
Amirreza Zamani, Tobias J. Oechtering, Mikael Skoglund

TL;DR
This paper develops a privacy mechanism design framework that balances data utility and privacy leakage by analyzing geometric properties of optimal solutions under a strong privacy criterion, especially considering non-zero leakage and non-invertible leakage matrices.
Contribution
It introduces a geometric approach to privacy mechanism design under non-zero leakage with non-invertible matrices, enabling linear programming solutions for privacy-utility trade-offs.
Findings
Allowing small leakage significantly improves utility.
The geometric structure of optimal mechanisms is perturbations of fixed distributions.
The proposed method outperforms existing approaches in privacy-utility trade-offs.
Abstract
We study a statistical signal processing privacy problem, where an agent observes useful data and wants to reveal the information to a user. Since the useful data is correlated with the private data , the agent employs a privacy mechanism to generate data that can be released. We study the privacy mechanism design that maximizes the revealed information about while satisfying a strong -privacy criterion. When a sufficiently small leakage is allowed, we show that the optimizer vectors of the privacy mechanism design problem have a specific geometry, i.e., they are perturbations of fixed vector distributions. This geometrical structure allows us to use a local approximation of the conditional entropy. By using this approximation the original optimization problem can be reduced to a linear program so that an approximate solution for privacy mechanism can be easily…
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 · Adversarial Robustness in Machine Learning
