Student or educator? Sign up with your school email and get 6 months of Pro free.

The DOI matches its Crossref record; 80 of the 80 references it cites were found in a registry or an index; 14 of the 28 sources its claims cite were checked for support.

When Machine Unlearning Jeopardizes Privacy

Open access
Chen, Min, Zhang, Zhikun, Wang, Tianhao, Backes, Michael, Humbert, Mathias, Zhang, Yang · 2021 · Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security

Abstract

This paper performs the first study on unintended information leakage caused by machine unlearning and proposes a novel membership inference attack.

Overview

CoChat Summary

## TL;DR

The paper shows that machine unlearning can unintentionally leak membership information by letting an attacker compare outputs of the original and unlearned models. Across multiple datasets and model types, the proposed attack often outperforms classical membership inference, especially on well-generalized models.

## Key findings

  • On categorical datasets, the attack “consistently better[s] than classical membership inference” and achieves up to 0.48 improvement in AUC; the best reported DegCount and DegRate are 0.94 and 0.40.
  • On image datasets, the attack also outperforms classical membership inference in all settings; for CIFAR10 + DenseNet, the paper reports an overfitting level of 0.439, with the highest privacy degradation, while MNIST + SimpleCNN has overfitting < 0.05 and the lowest degradation.
  • For a well-generalized decision tree on the Adult dataset, classical membership inference is near random with AUC = 0.497, while the proposed attack reaches AUC = 0.882; the paper also reports DegCount = 0.85 and DegRate = 0.28 for this example.
  • Transfer is strong: in one dataset-transfer example, the attack AUC drops only 1% (from 0.944 to 0.931) when moving from Insta-NY → Insta-LA for a decision tree target model.
  • Against the approximate SISA unlearning method, attack performance drops compared with retraining from scratch, indicating SISA reduces the influence of a specific sample on the global model.

## Methods

  • The paper studies black-box membership inference in machine unlearning: the adversary queries both the original model and the unlearned model, extracts their posterior outputs, constructs features from both, and trains a binary attack model.
  • It evaluates on categorical datasets (Adult, Accident, Insta-NY, Insta-LA) and image datasets (MNIST, CIFAR10, STL10) using target models including logistic regression, decision tree, random forest, MLP, SimpleCNN, DenseNet, and ResNet50.
  • Main analysis compares feature constructions (DirectConcat, SortedConcat, DirectDiff, SortedDiff, EucDist), tests overfitting effects, shadow-model transferability, multiple intermediate unlearned models, group deletion, online learning, and defense mechanisms.

## Limitations

  • The paper explicitly notes that the evaluation of the attack in other scenarios is deferred to Section 6, and that some experiments are limited by space; for example, the multiple-intermediate-models experiment is concentrated on Insta-NY with three target models.
  • The defense DP-SGD is only reported for logistic regression because it can only be applied to models that undergo gradient updating; this is stated in the paper.
  • Evident from the text: several reported results are based on selected datasets/models and some figures/tables are partially summarized in the excerpt, so the paper’s broader empirical coverage is not fully visible here.

Model-written summary. Check it against the paper before relying on it.

Integrity signals

Registry

Crossref · 10.1145/3460120.3484756

Cites

80 of 80 references verified0 citation errors · 0 not checkable

Statistics

Nothing to recompute.

Verification

Claims the paper makes

5 Valid · 1 Not valid · 5 Not checked · 94 Own results and interpretations

58 more claims

Create a free account to see all 105 claims and to verify the 7 references still open.

See all claims — free account
  • Probably not a substantial claim. 16
  • It may state two separate claims as one. 28
  • The quote only partly states this claim. 2

Create a free account to see these claims.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Show all 66 references

Research works printed but not linked: 1

  1. Reza Shokri, Martin Strobel, and Yair Zick. Exploiting Transparency Measures for Membership Inference: a Cautionary Tale. In The AAAI Workshop on Privacy-Preserving Artificial Intelligence (PPAI). AAAI, 2020.

Cited by

See all 195

Metadata

Authors
Chen, M., Zhang, Z., Wang, T., Backes, M., Humbert, M., & Zhang, Y.
Affiliations
  • Helmholtz Center for Information Security (DE)
  • University of Virginia (US)
  • CISPA Helmholtz Center for Information Security, Saarbrücken, Germany
  • University of Lausanne (CH)
Venue
Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security
Publisher
ACM
Published
2021-11-12
Pages
896-911
ISSN
1543-7221 (ISSN-L)
OpenAlex
W3023153742
Cited by
195
References
66
Citations by year
2026: 33 · 2025: 61 · 2024: 45 · 2023: 30 · 2022: 20 · 2021: 6
FWCI
11.67
Type
conference paper
Language
en
Open access
Locations
  • ACM SIGSAC Conference on Computer and Communications Security (CCS) (publishedVersion)
  • VU Research Portal (publishedVersion)
  • SERVAL (Université de Lausanne) (publishedVersion, other-oa)
  • arXiv (Cornell University) (submittedVersion)
  • IRIS (submittedVersion)
  • VU Research Portal (submittedVersion)
  • arXiv (Cornell University)
Funders
  • Helmholtz Association (ZT-I-OO1 4)
  • National Science Foundation (1931443)
  • Purdue University (Bilsland Dissertation Fellowship)
  • David and Lucile Packard Foundation (Packard Fellowship)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Privacy-Preserving Technologies in Data
  • Physical Sciences › Computer Science › Artificial Intelligence › Adversarial Robustness in Machine Learning
  • Social Sciences › Sociology and Political Science › Privacy, Security, and Data Protection
Keywords
machine unlearning, right to be forgotten, membership inference attacks, information leakage, temperature scaling, differential privacy, privacy preservation

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

The claim verdicts this report counts are experimental: their accuracy is not yet measured.

A language model drew the claims from the paper on 2026-10-11, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).

A second model labelled each claim on 2026-10-11 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).

Cited sources are checked with a language model’s help (gpt-6-sol).

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: When Machine Unlearning Jeopardizes Privacy. https://app.cochat.ai/papers/10.1145/3460120.3484756
The paper
Chen, M., Zhang, Z., Wang, T., Backes, M., Humbert, M., & Zhang, Y. (2021). When Machine Unlearning Jeopardizes Privacy. Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security. https://doi.org/10.1145/3460120.3484756

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.