The DOI matches its Crossref record; 192 of the 197 references it cites were found in a registry or an index, and 1 are not checked yet.
Adversarial machine learning
Abstract
In this paper (expanded from an invited talk at AISEC 2010), we discuss an emerging field of study: adversarial machine learning---the study of effective machine learning techniques against an adversarial opponent. In this paper, we: give a taxonomy for classifying attacks against online machine learning algorithms; discuss application-specific factors that limit an adversary's capabilities; introduce two models for modeling an adversary's capabilities; explore the limits of an adversary's knowledge about the algorithm, feature space, training, and input data; explore vulnerabilities in machine learning algorithms; discuss countermeasures against attacks; introduce the evasion challenge; and discuss privacy-preserving learning techniques.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
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?
In the citing paper
“Indeed, models might not fail in obvious ways, or might even be subject to attacks designed to change them in targeted ways [41].”
From Fairness and Accountability Design Needs for Algorithmic Support in High-Stakes Public Sector Decision-Making (2018) · cites this paper as [41]
In the citing paper
“Second, many of the promising approaches to building safe AI rely on a lack of cooperation, such as adversarial training (Huang et al., 2011; Perez et al., 2022a; Ziegler et al., 2022) or scalable oversight (Christiano et al., 2018, 2021; Greenblatt et al., 2023; Irving et al., 2018; Leike et al., 2018).”
From Multi-Agent Risks from Advanced AI (2025) · cites this paper as Huang et al., 2011
In the citing paper
“Similarly, many of the more promising approaches to ensure the safety of advanced AI are implicitly multi-agent, such as adversarial training (Huang et al., 2011; Perez et al., 2022a; Ziegler et al., 2022), oversight schemes (Christiano et al., 2018, 2021; Greenblatt et al., 2023; Irving et al., 2018; Leike et al., 2018), the modularisation of agents (Dalrymple et al., 2024; Drexler, 2019), or”
From Multi-Agent Risks from Advanced AI (2025) · cites this paper as Huang et al., 2011
In the citing paper
“Many of the more promising approaches to ensuring the safety of advanced AI are implicitly multi-agent, such as adversarial training (Huang et al., 2011; Perez et al., 2022a; Ziegler et al., 2022), oversight schemes (Christiano et al., 2018, 2021; Greenblatt et al., 2023; Irving et al., 2018; Leike et al., 2018), the modularisation of agents (Dalrymple et al., 2024; Drexler, 2019), or automated”
From Multi-Agent Risks from Advanced AI (2025) · cites this paper as Huang et al., 2011
In the citing paper
“From the equation above, we can notice that solving for matrix Ω is not dependent on the data and therefore can be computed centrally; one major contribution of [15] is an efficient distributed optimization method for the W step.”
From Data Poisoning Attacks on Federated Machine Learning (2022) · cites this paper as [15]
6 more claims about this paper
Create a free account to see every claim other papers make about this one.
Citations
Cites
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
The Nature of Statistical Learning Theory
Vapnik, V. N. (1995) · doi:10.1007/978-1-4757-2440-0 · Cited by 39,138
A Simplex Method for Function Minimization
Nelder, J. A., & Mead, R. (1965) · The Computer Journal · doi:10.1093/comjnl/7.4.308 · Cited by 28,905
The Elements of Statistical Learning
Hastie, T., Tibshirani, R., & Friedman, J. (2009) · Springer Series in Statistics · doi:10.1007/978-0-387-84858-7 · Cited by 25,970
Book Review: Pattern Recognition and Machine Learning
Nasrabadi, N. M. (2007) · Journal of Electronic Imaging · doi:10.1117/1.2819119 · Cited by 22,066 · cited 1×
“bounded PCA [36], anomaly detection algorithms that use hyper-sphere boundaries [5], one-class classifiers that predict anomalies by thresholding the log-likelihood of a log-concave (or uni-modal) density function, and some quadratic classifiers.”
MethodAdhi Harmoko, S., M.Komp, Jacquard, J. M., Zuse, K., & Eniac (2005) · Cited by 18,035
A Tutorial on Support Vector Machines for Pattern Recognition
Burges, C. J. C. (1998) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009715923555 · Cited by 16,429
New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713
An Introduction to Support Vector Machines and Other Kernel-based Learning Methods
Cristianini, N., & Shawe-Taylor, J. (2000) · doi:10.1017/cbo9780511801389 · Cited by 13,855 · cited 13×
“5.1.1 Example: Private SVM Learning As a more practical example we have previously studied di.erentiallyprivate mechanismsforsupportvector machine (SVM) learning [56].”
BackgroundMethodInfluentialA method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1983) · Communications of the ACM · doi:10.1145/357980.358017 · Cited by 13,012
Research works printed but not linked: 6
- 10.5555/1137817 · doi:10.5555/1137817
- 10.5555/345662 · doi:10.5555/345662
- R. A. Fisher . Question 14: Combining independent tests of significance. American Statistician, 2(5):30--31 , 1948 . R. A. Fisher. Question 14: Combining independent tests of significance. American Statistician, 2(5):30--31, 1948.
- A. Kerckhoffs . La cryptographie militaire . Journal des Sciences Militaires , 9 : 5 -- 83 , January 1883 . A. Kerckhoffs. La cryptographie militaire. Journal des Sciences Militaires, 9:5--83, January 1883.
- T. Mitchell . Machine Learning . McGraw Hill , 1997 . T. Mitchell. Machine Learning. McGraw Hill, 1997.
- B. Nelson and A. D. Joseph . Bounding an attack's complexity for a simple learning model . In Proc. Workshop on Tackling Computer Systems Problems with Machine Learning Techniques , 2006 . B. Nelson and A. D. Joseph. Bounding an attack's complexity for a simple learning model. In Proc. Workshop on Tackling Computer Systems Problems with Machine Learning Techniques, 2006.
Cited by
The Limitations of Deep Learning in Adversarial Settings
Papernot, N., McDaniel, P., Jha, S., Fredrikson, M., Celik, Z. B., & Swami, A. (2016) · 2016 IEEE European Symposium on Security and Privacy (EuroS&P) · doi:10.1109/eurosp.2016.36 · Cited by 3,993
Practical Black-Box Attacks against Machine Learning
Papernot, N., McDaniel, P., Goodfellow, I., Jha, S., Celik, Z. B., & Swami, A. (2017) · Proceedings of the 2017 ACM on Asia Conference on Computer and Communications Security · doi:10.1145/3052973.3053009 · Cited by 3,495
Distillation as a Defense to Adversarial Perturbations Against Deep Neural Networks
Papernot, N., McDaniel, P., Wu, X., Jha, S., & Swami, A. (2016) · 2016 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp.2016.41 · Cited by 2,982
“Such attacks commonly occur today in non-DL classification systems [12], [13], [14], [15], [16].”
BackgroundBoosting Adversarial Attacks with Momentum
Dong, Y., Liao, F., Pang, T., Su, H., Zhu, J., Hu, X., & Li, J. (2018) · 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2018.00957 · Cited by 2,956
“ntroduction It has long been shown that machine learning models are vulnerable to adversarial examples, which are the inputs crafted to make a model output attacker-desired but inaccurate predictions [3,18,11]. In particular, state-of-theart deep neural networks (DNNs) are challenged by their vulnerability to adversar…”
BackgroundReview of Deep Learning Algorithms and Architectures
Shrestha, A., & Mahmood, A. (2019) · IEEE Access · doi:10.1109/access.2019.2912200 · Cited by 1,883
“Reference [86] demonstrates these and other vulnerabilities and discusses how application domain, features and data distribution can be used to reduce the risk and impact of such adversarial attacks.”
Background
Metadata
- Authors
- Huang, L., Joseph, A. D., Nelson, B., Rubinstein, B. I. P., & Tygar, J. D.
- Affiliations
- Intel (United States) (US)
- University of California, Berkeley (US)
- University of Tübingen (DE)
- Microsoft (United States) (US)
- Venue
- Proceedings of the 4th ACM workshop on Security and artificial intelligence
- Publisher
- ACM
- Published
- 2011-10-21
- Pages
- 43-58
- OpenAlex
- W2095577883
- Cited by
- 1,194
- References
- 197
- Citations by year
- 2026: 33 · 2025: 73 · 2024: 85 · 2023: 95 · 2022: 100 · 2021: 185 · 2020: 165 · 2019: 131 · 2018: 128 · 2017: 80 · 2016: 40 · 2015: 31 · 2014: 32 · 2013: 10 · 2012: 5
- FWCI
- 12.02
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- ACM Workshop on Artificial Intelligence and Security (AISec) (publishedVersion)
- 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 › Hardware and Architecture › Security and Verification in Computing
- Keywords
- adversarial learning, online machine learning, opponent modeling, evasion attacks, countermeasures, privacy-preserving machine learning
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Adversarial machine learning. https://app.cochat.ai/papers/10.1145/2046684.2046692
- The paper
- Huang, L., Joseph, A. D., Nelson, B., Rubinstein, B. I. P., & Tygar, J. D. (2011). Adversarial machine learning. Proceedings of the 4th ACM workshop on Security and artificial intelligence. https://doi.org/10.1145/2046684.2046692
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.