A Simple Presentation of Robust Membership Inference Attacks
In a membership inference attack, an attacker is given the data of a particular individual, and tries to determine if that individual was included in a particular dataset, given some kind of statistics derived from the dataset or a model trained on the dataset. Roughly, a membership inference attack is robust if it succeeds even when the statistics are highly noisy, regardless of how that noise is introduced. We give a simple presentation of robust membership inference attacks for mean estimation, covering both multivariate Gaussian distributions and binary product distributions. We also give a summary of the literature on robust membership inference, covering history, extensions, and connections to other research areas.
Authors
- Jonathan Ullman (ORCID: https://orcid.org/0000-0002-0323-5564)
- Lydia Zakynthinou (ORCID: https://orcid.org/0000-0001-9258-6798)
- Renaud Gaucher
- Ephraim Linder (ORCID: https://orcid.org/0009-0009-1143-3649)
- Adam Smith
Publication Details
- Journal
- arXiv (Cornell University)
- Published
- 2026-10-27
- DOI
- https://doi.org/10.48550/arxiv.2610.36458
- Primary Topic
- Privacy-Preserving Technologies in Data
- Type
- preprint