A Critical Review on the Effectiveness and Privacy Threats of Membership Inference Attacks
Authors: Najeeb Jebreel, David Sánchez, Josep Domingo-Ferrer
Organizations: Universitat Rovira i Virgili, Department of Computer Engineering and Mathematics, CYBERCAT-Center for Cybersecurity Research of Catalonia, ComSCIAM-Center for Computational Science and Applied Mathematics Av. Països Catalans 26, 43007 Tarragona, Catalonia
Membership inference attacks (MIAs) aim to determine whether a data sample was included in a machine learning (ML) model's training set and have become the de facto standard for measuring privacy leakages in ML. We propose an evaluation framework that defines the conditions under which MIAs constitute a genuine privacy threat, and review representative MIAs against it. We find that, under the realistic conditions defined in our framework, MIAs represent weak privacy threats. Thus, relying on them as a privacy metric in ML can lead to an overestimation of risk and to unnecessary sacrifices in model utility as a consequence of employing too strong defenses.
Figures & tables
Figure 1: Overview of the proposed evaluation framework for MIAs. Condition C0 relates to the MIA disclosure potential, which critically depends on the data set used to train the target model. Conditions C1–C4 characterize the effectiveness of the MIA itself, which should reliably attack non-overfitted and competitive models at a reasonable computational cost.
Attack
Data set
Train acc. (%)
Test acc. (%)
g (%)
Non-overfitted?
SotA acc. (%)
Δ (%)
Competitive?
[ 65 ]
Adult
84.80
84.20
0.60
✓
88.16 [ 13 ]
3.96
✓
Purchase-100
NA
72.90
NA
NA
90.00 [ 69 ]
17.10
✗
Texas-100
NA
57.00
NA
NA
57.00 [ 65 ]
0.00
✓
Locations
100.00
67.30
32.70
✗
72.00 [ 45 ]
4.70
✓
MNIST
98.40
92.80
5.60
✓
99.87 [ 10 ]
7.07
✗
CIFAR-10
NA
60.00
NA
NA
99.50 [ 21 ]
39.50
✗
Table 1: Evaluation of model non-overfitting (C1) and competitiveness (C2)
Attack
Data set
Attack performance (%)
Prior p (%)
Reliable?
Prec.
TPR
FPR
[ 65 ]
Adult
50.30
NA
NA
50
✗
Purchase-100
73.00
86.00
31.81
50
✗
Locations
67.80
98.00
46.54
50
✗
Texas-100
69.00
86.00
38.64
50
✗
MNIST
51.70
NA
NA
50
✗
Table 2: Evaluation of attack performance and membership reliability (C3)
Attack
Resource requirements
Cost factors
Overall
M
I
Q
cost
[ 65 ]
10-100 additional models; K ML attack models; 1 query
High
Moderate
Low
High
[ 77 ]
Simple thresholding rule on loss values; 1 query
Low
Low
Low
Low
[ 63 ]
Simple thresholding rule; 1K random data points per data set; 1 query
Low
Low
Low
Low
[ 62 ]
30 additional models; 1 query
High
Low
Low
High
[ 50 ]
50 additional models; 1 query
High
Low
Low
High
Table 3: Evaluation of computational feasibility (C4). Cost factors: M: additional models required, I: inference model complexity, Q: queries required per target sample.
Appendix figures & tables1 asset
Supplementary material from the paper’s appendix.
Appendix
Attack
Approach
Venue
# citations
[ 65 ]
ML membership classifier on predictions from shadow models
IEEE SP 2017
7,083
[ 77 ]
Loss global thresholding
IEEE CSF 2018
1,751
[ 63 ]
Confidence and entropy global thresholding
NDSS 2019
1,329
[ 62 ]
Per-sample loss calibration and thresholding
ICML 2019
515
[ 50 ]
Hypothesis testing on loss values of selected vulnerable records
Euro SP 2020
143
[ 37 ]
Perturbed input loss thresholding
PoPETs 2021
194
Appendix
Table 4: Summary of the surveyed attacks. Citation counts according to Google Scholar, January 8, 2026.
Membership Inference Attacks (MIAs) are currently the dominant approach to evaluating privacy in machine learning applications. Despite their significance, several concerns remain unexplored, particularly with regard to tabular data. Existing evaluations focus predominantly on high-dimensional datasets, leaving the privacy behavior of small-to-medium datasets unexplored. In this paper, we present a new taxonomy for MIAs and conduct a comprehensive study of the factors influencing vulnerability. We evaluate four distinct state-of-the-art attacks across diverse tabular datasets and model architectures. Our results show that datasets with higher class granularity and majority class percentage are more susceptible to MIAs. We further demonstrate that advanced MIAs are highly dependent on adversarial knowledge of the target model, while reference model-free attacks often achieve statistically comparable results. Most importantly, we show that records with unique signatures (single-outs) remain highly vulnerable, even when common defenses are applied. These findings indicate that current defenses reduce average leakage, but fail to adequately protect the most sensitive individuals.
Cristina Pêra, Tânia Carvalho, Maxime Cordy +1
TekPrivacy, Portugal · SnT, University of Luxembourg, Luxembourg · Department of Computer Science, Faculty of Sciences of the University of Porto, Portugal
While Membership Inference Attacks (MIAs) are the prevailing method for identifying training data, their application has expanded into privacy auditing and machine unlearning. Nevertheless, the field lacks a systematic framework for evaluating how different contexts affect MIA efficacy. Without such a characterization, practitioners risk deploying algorithms that perform well on benchmarks but become statistically irrelevant when faced with the nuances of specific, real-world datasets. To bridge this gap and provide actionable insights, we introduce a comprehensive evaluation framework that systematically characterizes privacy risks across the entire machine learning pipeline, spanning data, architectures, algorithms, and post-training modules. Designed to inherently capture diverse operational contexts, our framework rigorously evaluates state-of-the-art MIAs across a broad spectrum of training configurations. To account for varying misclassification costs in real-world deployments, we employ three complementary metrics: Balanced Accuracy for symmetric costs, alongside TPR at low FPR (or TNR at low FNR) for asymmetric scenarios where false alarms or missed detections are strictly penalized. Furthermore, recognizing that existing MIAs assume divergent adversary capabilities, we formalize two standardized threat models and adapt these attacks into corresponding variants to ensure an equitable benchmark. Extensive empirical evaluations demonstrate that the efficacy of specific MIA methodologies is highly sensitive to the assumed threat models and chosen evaluation metrics. Ultimately, we distill these findings into actionable guidelines and provide a ready-to-use auditing toolkit, empowering practitioners to conduct better privacy assessments.
Ding Chen, Xinwen Cheng, Xuyang Zhong +3
City University of Hong Kong · Shanghai Jiao Tong University · denotes the correspondence author.
Membership inference attacks (MIAs) have become the standard tool for evaluating privacy leakage in machine learning (ML). Among them, the Likelihood-Ratio Attack (LiRA) is widely regarded as the state of the art when sufficient shadow models are available. However, prior evaluations have often overstated the effectiveness of LiRA by attacking models overconfident on their training samples, calibrating thresholds on target data, assuming balanced membership priors, and/or overlooking attack reproducibility. We re-evaluate LiRA under a realistic protocol that (i) trains models using anti-overfitting (AOF) and transfer learning (TL), when applicable, to reduce overconfidence as in production models; (ii) calibrates decision thresholds using shadow models and data rather than target data; (iii) measures positive predictive value (PPV, or precision) under shadow-based thresholds and skewed membership priors (pi <= 10%); and (iv) quantifies per-sample membership reproducibility across different seeds and training variations. We find that AOF significantly weakens LiRA, while TL further reduces attack effectiveness while improving model accuracy. Under shadow-based thresholds and skewed priors, LiRA's PPV often drops substantially, especially under AOF or AOF+TL. We also find that thresholded vulnerable sets at extremely low FPR show poor reproducibility across runs, while likelihood-ratio rankings are more stable. These results suggest that LiRA, and likely weaker MIAs, are less effective than previously suggested under realistic conditions, and that reliable privacy auditing requires evaluation protocols that reflect practical training practices, feasible attacker assumptions, and reproducibility considerations. Code is available at https://github.com/najeebjebreel/lira_analysis.