On privacy-utility tradeoffs for constrained data release mechanisms
The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Abstract
Privacy-preserving data release mechanisms aim to simultaneously minimize information-leakage with respect to sensitive data and distortion with respect to useful data. Dependencies between sensitive and useful data results in a privacy-utility tradeoff that has strong connections to generalized rate-distortion problems. In this work, we study how the optimal privacy-utility tradeoff region is affected by constraints on the data that is directly available as input to the release mechanism. In particular, we consider the availability of only sensitive data, only useful data, and both (full data). We show that a general hierarchy holds, that is, the tradeoff region given only the sensitive data is no larger than the region given only the useful data, which in turn is clearly no larger than the region given both sensitive and useful data. In addition, we determine conditions under which the tradeoff region given only the useful data coincides with that given full data. This is based on the common information between the sensitive and useful data.
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
k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY
SWEENEY, L. (2002) · International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems · doi:10.1142/s0218488502001648 · Cited by 8,571 · cited 1×
“These have subsequently motivated a wide variety of statistical formulations and techniques for preserving privacy, such as k-anonymity [4], L-diversity [5], t-closeness [6], and differential privacy [7].”
BackgroundCalibrating 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
L -diversity: Privacy beyond k -anonymity
Machanavajjhala, A., Kifer, D., Gehrke, J., & Venkitasubramaniam, M. (2007) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/1217299.1217302 · Cited by 3,617 · cited 1×
“These have subsequently motivated a wide variety of statistical formulations and techniques for preserving privacy, such as k-anonymity [4], L-diversity [5], t-closeness [6], and differential privacy [7].”
Backgroundt-Closeness: Privacy Beyond k-Anonymity and l-Diversity
Li, N., Li, T., & Venkatasubramanian, S. (2007) · 2007 IEEE 23rd International Conference on Data Engineering · doi:10.1109/icde.2007.367856 · Cited by 3,451
The information bottleneck method
Tishby, N., Pereira, F. C., & Bialek, W. (2000) · arXiv · doi:10.48550/arxiv.physics/0004057 · Cited by 2,626 · cited 1×
“This problem in the inference scenario, where the additional Markov chain constraint Y → X → Z is imposed, is equivalent to the Information Bottleneck problem considered in [14], which also provides a generalization of the BlahutArimoto algorithm [15] to perform this optimization.”
MethodRobust De-anonymization of Large Sparse Datasets
Narayanan, A., & Shmatikov, V. (2008) · 2008 IEEE Symposium on Security and Privacy (sp 2008) · doi:10.1109/sp.2008.33 · Cited by 2,372 · cited 1×
“Basic attempts to anonymize data have led to widely publicized leaks of sensitive information, such as [2], [3].”
Background
Cited by
Context-Aware Generative Adversarial Privacy
Huang, C., Kairouz, P., Chen, X., Sankar, L., & Rajagopal, R. (2017) · Entropy · doi:10.3390/e19120656 · Cited by 156
Privacy-Preserving Adversarial Networks
Tripathy, A., Wang, Y., & Ishwar, P. (2019) · 2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton) · doi:10.1109/allerton.2019.8919758 · Cited by 87
“As noted in [11], given a fixed data model PW,X,Y and distortion function d, the problem in (1) is a convex optimization problem, since the mutual information objective I(X;Z) is a convex functional of PZ|X , which is in turn a linear functional of PZ|W , and the expected distortion E[d(Y, Z)] is a linear functional o…”
BackgroundMethodInfluentialSelf-citationCompressive Privacy Generative Adversarial Network
Tseng, B.-W., & Wu, P.-Y. (2020) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2020.2968188 · Cited by 48
Metadata
- Authors
- Basciftci, Y. O., Wang, Y., & Ishwar, P.
- Venue
- 2016 Information Theory and Applications Workshop (ITA)
- Publisher
- IEEE
- Published
- 2016-01
- Pages
- 1-6
- OpenAlex
- W2597663268
- Cited by
- 63
- References
- 6
- FWCI
- 3.45
- Type
- conference paper
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On privacy-utility tradeoffs for constrained data release mechanisms. https://app.cochat.ai/papers/10.1109/ita.2016.7888175
- The paper
- Basciftci, Y. O., Wang, Y., & Ishwar, P. (2016). On privacy-utility tradeoffs for constrained data release mechanisms. 2016 Information Theory and Applications Workshop (ITA). https://doi.org/10.1109/ita.2016.7888175
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.