Differential Privacy as a Mutual Information Constraint
Open accessThe DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Abstract
Differential privacy is a precise mathematical constraint meant to ensure privacy of individual pieces of information in a database even while queries are being answered about the aggregate. Intuitively, one must come to terms with what differential privacy does and does not guarantee. For example, the definition prevents a strong adversary who knows all but one entry in the database from further inferring about the last one. This strong adversary assumption can be overlooked, resulting in misinterpretation of the privacy guarantee of differential privacy. Herein we give an equivalent definition of privacy using mutual information that makes plain some of the subtleties of differential privacy. The mutual-information differential privacy is in fact sandwiched between ε-differential privacy and (ε,δ)-differential privacy in terms of its strength. In contrast to previous works using unconditional mutual information, differential privacy is fundamentally related to conditional mutual information, accompanied by a maximization over the database distribution. The conceptual advantage of using mutual information, aside from yielding a simpler and more intuitive definition of differential privacy, is that its properties are well understood. Several properties of differential privacy are easily verified for the mutual information alternative, such as composition theorems.
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
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 3×
“For various reasons it has since been relaxed [13] to have two parameters ǫ and δ playing multiplicative and additive roles in the likelihood constraint.”
BackgroundBoosting and Differential Privacy
Dwork, C., Rothblum, G. N., & Vadhan, S. (2010) · 2010 IEEE 51st Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2010.12 · Cited by 784 · cited 1×
“More intricate trade-offs can be found in [14] and [17], with the latter establishing a tight characterization.”
BackgroundThe composition theorem for differential privacy
Kairouz, P., Oh, S., & Viswanath, P. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2685505 · Cited by 408 · cited 2×
“Finally, (ǫ, δ)-closeness is shown in [17] to be precisely a piecewise linear constraint on the error region in a binary hypothesis test.”
Background
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
Not All Features Are Equal: Discovering Essential Features for Preserving Prediction Privacy
Mireshghallah, F., Taram, M., Jalali, A., Elthakeb, A. T., Tullsen, D., & Esmaeilzadeh, H. (2020) · arXiv · doi:10.48550/arxiv.2003.12154 · Cited by 44
“The amount of mutual information between the raw data and the representation that is to be publicized is another measure of privacy that is widely used in literature (Cuff & Yu, 2016; Kalantari et al., 2017; Liao et al., 2017).”
Method
Metadata
- Authors
- Cuff, P., & Yu, L.
- Venue
- Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security
- Publisher
- ACM
- Published
- 2016-10-24
- Pages
- 43-54
- OpenAlex
- W2515654213
- Cited by
- 184
- References
- 4
- FWCI
- 7.62
- Type
- conference paper
- Language
- en
- Open access
- bronze
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Differential Privacy as a Mutual Information Constraint. https://app.cochat.ai/papers/10.1145/2976749.2978308
- The paper
- Cuff, P., & Yu, L. (2016). Differential Privacy as a Mutual Information Constraint. Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security. https://doi.org/10.1145/2976749.2978308
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.