Managing Your Private and Public Data: Bringing Down Inference Attacks Against Your Privacy
Open accessAbstract
We propose a practical methodology to protect a user's private data, when he wishes to publicly release data that is correlated with his private data, to get some utility. Our approach relies on a general statistical inference framework that captures the privacy threat under inference attacks, given utility constraints. Under this framework, data is distorted before it is released, according to a probabilistic privacy mapping. This mapping is obtained by solving a convex optimization problem, which minimizes information leakage under a distortion constraint. We address practical challenges encountered when applying this theoretical framework to real world data. On one hand, the design of optimal privacy mappings requires knowledge of the prior distribution linking private data and data to be released, which is often unavailable in practice. On the other hand, the optimization may become untractable when data assumes values in large size alphabets, or is high dimensional. Our work makes three major contributions. First, we provide bounds on the impact of a mismatched prior on the privacy-utility tradeoff. Second, we show how to reduce the optimization size by introducing a quantization step, and how to generate privacy mappings under quantization. Third, we evaluate our method on two datasets, including a new dataset that we collected, showing correlations between political convictions and TV viewing habits. We demonstrate that good privacy properties can be achieved with limited distortion so as not to undermine the original purpose of the publicly released data, e.g., recommendations.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
Due to users' lack of awareness of their privacy and the connection between public and private data, AIA can be executed in the system.
“Due to users' lack of awareness of their privacy and the connection between public and private data, AIA can be executed in the system [88, 100].”
From A Deep Dive into Fairness, Bias, Threats, and Privacy in Recommender Systems: Insights and Future Research (2024) · cites this paper as [100]
Obfuscation can be achieved by solving a multi-objective optimization problem where the objectives are improving RS accuracy and protecting users' privacy, or applying probabilistic privacy mapping between private and to-be-released public data, or removing the most indicative items of the sensitive data with the addition of some fictitious data to confuse the adversary.
“The obfuscation can be achieved by solving the multi-objective optimization problem where the objectives are improving RS accuracy & protecting users' privacy [119] or applying probabilistic privacy mapping between private & to be released public data [100] or removing the most indicative items of the sensitive data with the addition of some fictitious data to confuse the adversary [10, 11”
From A Deep Dive into Fairness, Bias, Threats, and Privacy in Recommender Systems: Insights and Future Research (2024) · cites this paper as [100]
Cited by
Sorted by citations
Privacy Risks of General-Purpose Language Models
Pan, X., Zhang, M., Ji, S., & Yang, M. (2020) · 2020 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp40000.2020.00095 · Cited by 188 · see citing works
Slokom, M., Hanjalic, A., & Larson, M. (2021) · Information Processing & Management · doi:10.1016/j.ipm.2021.102722 · Cited by 31 · see citing works
Roy, F., Ding, X., Choo, K. K. R., & Zhou, P. (2024) · arXiv · doi:10.48550/arxiv.2409.12651
- Authors
- Salamatian, S., Zhang, A., du Pin Calmon, F., Bhamidipati, S., Fawaz, N., Kveton, B., Oliveira, P., & Taft, N.
- Affiliations
- Massachusetts Institute of Technology (US)
- Technicolor (United States) (US)
- Adobe Systems (United States) (US)
- Google (United States) (US)
- Venue
- IEEE Journal of Selected Topics in Signal Processing
- Published
- 2015-10
- Volume
- 9
- Issue
- 7
- Pages
- 1240-1255
- ISSN
- 1932-4553 (ISSN-L)
- 1941-0484
- OpenAlex
- W1714669175
- Cited by
- 66
- References
- 0
- Citations by year
- 2025: 3 · 2024: 10 · 2023: 1 · 2022: 5 · 2021: 11 · 2020: 10 · 2019: 2 · 2018: 12 · 2017: 6 · 2016: 3 · 2015: 2 · 2013: 1
- FWCI
- 7.52
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- IEEE Journal of Selected Topics in Signal Processing (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Privacy-Preserving Technologies in Data
- Social Sciences › Sociology and Political Science › Privacy, Security, and Data Protection
- Physical Sciences › Computer Science › Information Systems › Cloud Data Security Solutions
- Keywords
- inference attacks, privacy-utility trade-off, information leakage, convex optimization, quantization, privacy-preserving data publishing, distortion constraint, political conviction, recommender systems
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