Cited by 229Adversarial Robustness in Machine LearningPrivacy-Preserving Technologies in DataSecurity and Verification in Computing

Privacy Risks of Securing Machine Learning Models against Adversarial Examples

Open access
Song, Liwei, Shokri, Reza, Mittal, Prateek·2019·Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security

Abstract

The arms race between attacks and defenses for machine learning models has come to a forefront in recent years, in both the security community and the privacy community. However, one big limitation of previous research is that the security domain and the privacy domain have typically been considered separately. It is thus unclear whether the defense methods in one domain will have any unexpected impact on the other domain. In this paper, we take a step towards resolving this limitation by combining the two domains. In particular, we measure the success of membership inference attacks against six state-of-the-art defense methods that mitigate the risk of adversarial examples (i.e., evasion attacks). Membership inference attacks determine whether or not an individual data record has been part of a model's training set. The accuracy of such attacks reflects the information leakage of training algorithms about individual members of the training set. Adversarial defense methods against adversarial examples influence the model's decision boundaries such that model predictions remain unchanged for a small area around each input. However, this objective is optimized on training data. Thus, individual data records in the training set have a significant influence on robust models. This makes the models more vulnerable to inference attacks. To perform the membership inference attacks, we leverage the existing inference methods that exploit model predictions. We also propose two new inference methods that exploit structural properties of robust models on adversarially perturbed data. Our experimental evaluation demonstrates that compared with the natural training (undefended) approach, adversarial defense methods can indeed increase the target model's risk against membership inference attacks. When using adversarial defenses to train the robust models, the membership inference advantage increases by up to 4.5 times compared to the naturally undefended models. Beyond revealing the privacy risks of adversarial defenses, we further investigate the factors, such as model capacity, that influence the membership information leakage.

Integrity signals

Registry

Crossref · 10.1145/3319535.3354211

Cites

10 of 10 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Song, L., Shokri, R., & Mittal, P.
Affiliations
  • Princeton University (US)
  • National University of Singapore (SG)
Venue
Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security
Publisher
ACM
Published
2019-11-06
Pages
241-257
ISSN
1543-7221 (ISSN-L)
OpenAlex
W2946363484
Cited by
229
References
10
Citations by year
2026: 16 · 2025: 32 · 2024: 39 · 2023: 37 · 2022: 39 · 2021: 39 · 2020: 24 · 2019: 3
FWCI
10.04
Type
conference paper
Language
en
Open access
Locations
  • ACM SIGSAC Conference on Computer and Communications Security (CCS) (publishedVersion, public-domain)
  • arXiv (Cornell University) (submittedVersion)
  • National University of Singapore (submittedVersion, cc-by-nc)
  • arXiv (Cornell University)
Funders
  • Army Research Office Young Investigator Prize
  • IBM Faculty research award
  • Office of Naval Research Young Investigator Award
  • Intel Faculty research award
  • National Science Foundation (CNS-1553437, CNS-1704105, CIF-1617286, EARS-1642962)
  • National Research Foundation, Prime Ministers Office, Singapore under its Strategic Capability Research Centres Funding Initiative
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Adversarial Robustness in Machine Learning
  • Physical Sciences › Computer Science › Artificial Intelligence › Privacy-Preserving Technologies in Data
  • Physical Sciences › Computer Science › Artificial Intelligence › Security and Verification in Computing
Keywords
membership inference attacks, adversarial defense, adversarial examples, evasion attacks, privacy leakage, robust machine learning, information leakage, model capacity, adversarial perturbations

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.

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