On the Relation Between Identifiability, Differential Privacy, and Mutual-Information Privacy
The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Abstract
This paper investigates the relation between three different notions of privacy: identifiability, differential privacy, and mutual-information privacy. Under a unified privacydistortion framework, where the distortion is defined to be the expected Hamming distance between the input and output databases, we establish some fundamental connections between these three privacy notions. Given a maximum allowable distortion D, we define the privacy-distortion functions ∈i* (D), ∈d*(D), and ∈m*(D) to be the smallest (most private/best) identifiability level, differential privacy level, and mutual information between the input and the output, respectively. We characterize ∈i* (D) and ∈d*(D), and prove that ∈i* (D) - ∈X≤ ∈d*(D) ≤ ∈i* (D) for D within certain range, where ∈Xis a constant determined by the prior distribution of the original database X, and diminishes to zero when X is uniformly distributed. Furthermore, we show that ∈i* (D) and ∈m*(D) can be achieved by the same mechanism for D within certain range, i.e., there is a mechanism that simultaneously minimizes the identifiability level and achieves the best mutual-information privacy. Based on these two connections, we prove that this mutual-information optimal mechanism satisfies ∈-differential privacy with ∈d*(D) ≤ ∈ ≤ ∈d*(D)+2∈X. The results in this paper reveal some consistency between two worst case notions of privacy, namely, identifiability and differential privacy, and an average notion of privacy, mutual-information privacy.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2005) · doi:10.1002/047174882x · Cited by 13,791
Calibrating Noise to Sensitivity in Private Data Analysis
Dwork, C., McSherry, F., Nissim, K., & Smith, A. (2006) · Lecture Notes in Computer Science · doi:10.1007/11681878_14 · Cited by 7,272
The Algorithmic Foundations of Differential Privacy
Dwork, C., & Roth, A. (2014) · Foundations and Trends® in Theoretical Computer Science · doi:10.1561/0400000042 · Cited by 5,557
The Algorithmic Foundations of Differential Privacy
Dwork, C., & Roth, A. (2013) · doi:10.1561/9781601988195 · Cited by 3,856
Our Data, Ourselves: Privacy Via Distributed Noise Generation
Dwork, C., Kenthapadi, K., McSherry, F., Mironov, I., & Naor, M. (2006) · Lecture Notes in Computer Science · doi:10.1007/11761679_29 · Cited by 1,835 · cited 1×
“Differential privacy, as an emerging analytical foundation for privacy-preserving data analysis, was developed by a line of work [1]–[3], and since then both interactive model (e.g., [1], [4]–[9]) and non-interactive model (e.g., [8], [10]–[15]) have been studied in the literature.”
BackgroundComputation of channel capacity and rate-distortion functions
Blahut, R. (1972) · IEEE Transactions on Information Theory · doi:10.1109/tit.1972.1054855 · Cited by 1,381
Cited by
Deep Variational Information Bottleneck
Alemi, A. A., Fischer, I., Dillon, J. V., & Murphy, K. P. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1612.00410 · Cited by 321
Metadata
- Authors
- Wang, W., Ying, L., & Zhang, J.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2016-09
- Volume
- 62
- Issue
- 9
- Pages
- 5018-5029
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2564029303
- Cited by
- 169
- References
- 6
- FWCI
- 9.41
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.