RAPID: Risk of Attribute Prediction-Induced Disclosure in Synthetic Microdata
Matthias Templ, Oscar Thees, Roman Müller
TL;DR
RAPID addresses the gap in measuring attribute-inference risk in fully synthetic microdata by quantifying per-record disclosure vulnerability under a realistic attacker who trains predictors on synthetic data. It formalizes both categorical and continuous sensitive attributes through baseline-normalized confidence and tolerance-based errors, respectively, and returns a bounded, interpretable risk metric with threshold-based reporting. The method supports rigorous threshold calibration, uncertainty quantification, and diagnostic analyses (e.g., quasi-identifier attribution), while remaining agnostic to the specific synthesizer and learning algorithm. RAPID complements differential privacy by providing a practical, attacker-focused risk diagnostic that informs release decisions and risk-mutility trade-offs in public-use synthetic data.
Abstract
Statistical data anonymization increasingly relies on fully synthetic microdata, for which classical identity disclosure measures are less informative than an adversary's ability to infer sensitive attributes from released data. We introduce RAPID (Risk of Attribute Prediction--Induced Disclosure), a disclosure risk measure that directly quantifies inferential vulnerability under a realistic attack model. An adversary trains a predictive model solely on the released synthetic data and applies it to real individuals' quasi-identifiers. For continuous sensitive attributes, RAPID reports the proportion of records whose predicted values fall within a specified relative error tolerance. For categorical attributes, we propose a baseline-normalized confidence score that measures how much more confident the attacker is about the true class than would be expected from class prevalence alone, and we summarize risk as the fraction of records exceeding a policy-defined threshold. This construction yields an interpretable, bounded risk metric that is robust to class imbalance, independent of any specific synthesizer, and applicable with arbitrary learning algorithms. We illustrate threshold calibration, uncertainty quantification, and comparative evaluation of synthetic data generators using simulations and real data. Our results show that RAPID provides a practical, attacker-realistic upper bound on attribute-inference disclosure risk that complements existing utility diagnostics and disclosure control frameworks.
