Pith. sign in

REVIEW 11 cited by

Low-Cost High-Power Membership Inference Attacks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2312.03262 v3 pith:GBW4P7BW submitted 2023-12-06 stat.ML cs.CRcs.LG

classification stat.MLcs.CRcs.LG
keywords attacksdatainferencemembershipreferencermiacomputationalmodels
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Membership inference attacks aim to detect if a particular data point was used in training a model. We design a novel statistical test to perform robust membership inference attacks (RMIA) with low computational overhead. We achieve this by a fine-grained modeling of the null hypothesis in our likelihood ratio tests, and effectively leveraging both reference models and reference population data samples. RMIA has superior test power compared with prior methods, throughout the TPR-FPR curve (even at extremely low FPR, as low as 0). Under computational constraints, where only a limited number of pre-trained reference models (as few as 1) are available, and also when we vary other elements of the attack (e.g., data distribution), our method performs exceptionally well, unlike prior attacks that approach random guessing. RMIA lays the groundwork for practical yet accurate data privacy risk assessment in machine learning.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 11 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Membership Inference Attacks for Unseen Classes

    cs.LG 2025-06 conditional novelty 7.0 of 10

    In a new 'unseen class' setting for membership inference, quantile regression attacks outperform shadow model attacks, which fall to the level of a global-threshold baseline.

  2. Vid-SME: Membership Inference Attacks against Large Video Understanding Models

    cs.CV 2025-05 reject novelty 7.0 of 10

    Vid-SME computes Sharma-Mittal entropy differences between natural and reversed video frame sequences to infer training membership in video understanding LLMs, but its effectiveness is confounded by member/non-member ...

  3. Phantoms and Disclosures: A Statistical Framework for Auditing Privacy in Synthetic Data

    cs.LG 2026-06 conditional novelty 6.0 of 10

    A model-agnostic audit detects synthetic data disclosures via feature-match and membership-inference tests that separate true from phantom leaks and give empirical differential-privacy lower bounds.

  4. Stealth by Conformity: Evading Robust Aggregation through Adaptive Poisoning

    cs.CR 2025-09 conditional novelty 6.0 of 10

    An adaptive federated-learning backdoor attack uses membership-inference feedback on the global model to keep malicious updates statistically similar to benign ones, evading nine robust aggregation defenses in two ima...

  5. Membership Inference Attacks as Privacy Tools: Reliability, Disparity and Ensemble

    cs.LG 2025-06 conditional novelty 6.0 of 10

    MIAs expose different members depending on attack method and random seed; the paper quantifies this with coverage/stability and shows ensembling attacks yields stronger, more reliable privacy checks.

  6. DeSIA: Attribute Inference Attacks Against Limited Fixed Aggregate Statistics

    cs.CR 2025-04 conditional novelty 6.0 of 10

    DeSIA infers sensitive attributes from limited fixed aggregate statistics by first checking whether a value is uniquely forced by the counts, then using a shadow-model classifier, outperforming reconstruction baseline...

  7. Black-Box Privacy Attacks on Shared Representations in Multitask Learning

    cs.LG 2025-06 conditional novelty 5.0 of 10

    A purely black-box attacker can infer whether a task was included in multitask training by measuring the variance or pairwise inner products of embedding vectors, with near-perfect success when tasks correspond to lab...

  8. Privacy Leaks by Adversaries: Adversarial Iterations for Membership Inference Attack

    cs.CR 2025-06 conditional novelty 5.0 of 10

    Counting the iterations required to craft an adversarial example can reveal whether a sample was in the model's training set.

  9. Membership Inference Attacks with False Discovery Rate Control

    stat.ML 2025-08 conditional novelty 4.0 of 10

    A post-hoc wrapper, MIAFdR, converts any membership inference attack scores into conformal p-values and applies a Benjamini-Hochberg correction, guaranteeing that the expected proportion of non-members among flagged m...

  10. Technical Report for the Forgotten-by-Design Project: Targeted Obfuscation for Machine Learning

    cs.LG 2025-01 conditional novelty 4.0 of 10

    Per-sample gradient noise and exponential down-weighting of LIRA-identified vulnerable points reduce membership inference success on CIFAR-10 while keeping test accuracy near baseline.

  11. Synthetic Tabular Data: Methods, Attacks and Defenses

    cs.LG 2025-06 conditional novelty 1.0 of 10

    A review of tabular synthetic data generation, privacy attacks, and defenses, whose central message is that synthetic data alone does not guarantee privacy.

Pith tools