Information Density Bounds for Privacy
Sara Saeidian (1, 2), Leonhard Grosse (1), Parastoo Sadeghi (3), Mikael Skoglund (1), Tobias J. Oechtering (1) ((1) KTH Royal Institute of Technology, (2) Inria Saclay, (3) University of New South Wales)

TL;DR
This paper introduces a new privacy measure called pointwise maximal cost (PMC), linking it to existing measures and demonstrating its practical relevance for ensuring privacy through information density bounds.
Contribution
It defines PMC, explores its properties, and connects it with established privacy measures like PML and LDP, filling gaps in privacy measure taxonomy.
Findings
PMC quantifies information leakage about secrets.
Bounded PMC and PML characterize local differential privacy.
PMC provides operational insights into privacy guarantees.
Abstract
This paper explores the implications of guaranteeing privacy by imposing a lower bound on the information density between the private and the public data. We introduce a novel and operationally meaningful privacy measure called pointwise maximal cost (PMC) and demonstrate that imposing an upper bound on PMC is equivalent to enforcing a lower bound on the information density. PMC quantifies the information leakage about a secret to adversaries who aim to minimize non-negative cost functions after observing the outcome of a privacy mechanism. When restricted to finite alphabets, PMC can equivalently be defined as the information leakage to adversaries aiming to minimize the probability of incorrectly guessing randomized functions of the secret. We study the properties of PMC and apply it to standard privacy mechanisms to demonstrate its practical relevance. Through a detailed examination,…
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 · Stochastic Gradient Optimization Techniques · Cryptography and Data Security
