When the Signal is in the Noise: Exploiting Diffix's Sticky Noise
Andrea Gadotti, Florimond Houssiau, Luc Rocher, Benjamin Livshits, Yves-Alexandre de Montjoye
摘要
Anonymized data is highly valuable to both businesses and researchers. A large body of research has however shown the strong limits of the de-identification release-and-forget model, where data is anonymized and shared. This has led to the development of privacy-preserving query-based systems. Based on the idea of "sticky noise", Diffix has been recently proposed as a novel query-based mechanism satisfying alone the EU Article 29 Working Party's definition of anonymization. According to its authors, Diffix adds less noise to answers than solutions based on differential privacy while allowing for an unlimited number of queries. This paper presents a new class of noise-exploitation attacks, exploiting the noise added by the system to infer private information about individuals in the dataset. Our first differential attack uses samples extracted from Diffix in a likelihood ratio test to discriminate between two probability distributions. We show that using this attack against a synthetic best-case dataset allows us to infer private information with 89.4% accuracy using only 5 attributes. Our second cloning attack uses dummy conditions that conditionally strongly affect the output of the query depending on the value of the private attribute. Using this attack on four real-world datasets, we show that we can infer private attributes of at least 93% of the users in the dataset with accuracy between 93.3% and 97.1%, issuing a median of 304 queries per user. We show how to optimize this attack, targeting 55.4% of the users and achieving 91.7% accuracy, using a maximum of only 32 queries per user. Our attacks demonstrate that adding data-dependent noise, as done by Diffix, is not sufficient to prevent inference of private attributes. We furthermore argue that Diffix alone fails to satisfy Art. 29 WP's definition of anonymization. We conclude by discussing how non-provable privacy-preserving sys-
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper3
- A Linear Reconstruction Approach for Attribute Inference Attacks against Synthetic DataMeenatchi Sundaram Muthu Selva Annamalai, Andrea Gadotti, Luc RocherUSENIX Security 2024 · 被引用 37 次
- Side-Channel Attacks on Query-Based Data AnonymizationFranziska Boenisch, Reinhard Munz, Marcel Tiepelt, Simon Hanisch 等CCS 2021 · 被引用 8 次
- QueryCheetah: Fast Automated Discovery of Attribute Inference Attacks Against Query-Based SystemsBozhidar Stevanoski, Ana-Maria Cretu, Yves-Alexandre de MontjoyeCCS 2024
它引用的顶会 Paper1
相关 Paper
- Dependence Makes You Vulnberable: Differential Privacy Under Dependent TuplesChangchang Liu, Supriyo Chakraborty, Prateek MittalNDSS 2016 · 被引用 210 次
- QuerySnout: Automating the Discovery of Attribute Inference Attacks against Query-Based SystemsAna-Maria Cretu, Florimond Houssiau, Antoine Cully, Yves-Alexandre de MontjoyeCCS 2022 · 被引用 8 次
- The Inadequacy of Similarity-Based Privacy Metrics: Privacy Attacks Against "Truly Anonymous" Synthetic DatasetsGeorgi Ganev, Emiliano De CristofaroS&P 2025
- Mjölnir: Breaking the Shield of Perturbation-Protected Gradients via Adaptive DiffusionXuan Liu, Siqi Cai, Qihua Zhou, Song Guo 等AAAI 2025 · 被引用 4 次
- Learning to Generate Inversion-Resistant Model ExplanationsHoyong Jeong, Suyoung Lee, Sung Ju Hwang, Sooel SonNeurIPS 2022 · 被引用 4 次
