Papers › Practical Black-Box Attacks against Machine Learning

Practical Black-Box Attacks against Machine Learning

8 Feb 2016arXiv:1602.02697archive 2025-07-28

Nicolas Papernot, Patrick McDaniel, Ian Goodfellow, Somesh Jha, Z. Berkay Celik, Ananthram Swami

Machine learning (ML) models, e.g., deep neural networks (DNNs), are vulnerable to adversarial examples: malicious inputs modified to yield erroneous model outputs, while appearing unmodified to human observers. Potential attacks include having malicious content like malware identified as legitimate or controlling vehicle behavior. Yet, all existing adversarial example attacks require knowledge of either the model internals or its training data. We introduce the first practical demonstration of an attacker controlling a remotely hosted DNN with no such knowledge. Indeed, the only capability of our black-box adversary is to observe labels given by the DNN to chosen inputs. Our attack strategy consists in training a local model to substitute for the target DNN, using inputs synthetically generated by an adversary and labeled by the target DNN. We use the local substitute to craft adversarial examples, and find that they are misclassified by the targeted DNN. To perform a real-world and properly-blinded evaluation, we attack a DNN hosted by MetaMind, an online deep learning API. We find that their DNN misclassifies 84.24% of the adversarial examples crafted with our substitute. We demonstrate the general applicability of our strategy to many ML techniques by conducting the same attack against models hosted by Amazon and Google, using logistic regression substitutes. They yield adversarial examples misclassified by Amazon and Google at rates of 96.19% and 88.94%. We also find that this black-box attack strategy is capable of evading defense strategies previously found to make adversarial example crafting harder.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="1602.02697")

Code

Syntology Ran 4 of 11 code samples harvested from 2 repositories linked to this paper; 7 have no recorded run. Of those that ran: 3 ran · honoured contract; 1 ran · our draft was wrong.

By repository: community (archive-listed): 10 samples from 2 repositories, 3 ran; 1 identical to code first harvested elsewhere. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

18 repositories listed; official and paper-mentioned ones first.

AngusG/cleverhans-attacking-bnns mentioned on GitHubtfMIT report
HowToMakeABomb101/Hot2MakeAB0mbSite mentioned on GitHubtfMIT report
cleverhans-lab/cleverhans mentioned on GitHubtfMIT report
daisy611/fusion mentioned on GitHub report
elites2k19/prism-attack mentioned on GitHubtfMIT report
formal-verification-research/NJSMA mentioned on GitHubtfMIT report
iirishikaii/cleverhans mentioned on GitHubtfMIT report
inhopark94/ihpark mentioned on GitHubpytorch report
jbinas/fortified-networks mentioned on GitHubtfMIT report
johnsonkee/graduate_design mentioned on GitHubtfMIT report
openai/cleverhans mentioned on GitHubtf report
shijiel2/cleverhans mentioned on GitHubtf report
tensorflow/cleverhans mentioned on GitHubtfMIT report
yaq007/cleverhans mentioned on GitHubtfMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

11 samples harvested; 4 ran; 3 honoured the contract we drafted; 7 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

3ran · honoured contract
1ran · our draft was wrong
7unverified

Licence: 4 of the 11 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from 2 repositories linked to this paper, official or community; each sample names its own and says which. Some samples are identical code Syntology first harvested from another repository; for those, this paper's copy is not located and its licence is not recorded. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

norm_l0 probabilistic-jsmas/probabilistic-jsmas/start_stats.py community (archive-listed) ran · honoured contract fingerprinted no licence file found · pointer only · b265d88671923e2c · report
norm_l1 probabilistic-jsmas/probabilistic-jsmas/start_stats.py community (archive-listed) ran · honoured contract fingerprinted no licence file found · pointer only · 3488e2e71e94a1a4 · report
norm_l2 probabilistic-jsmas/probabilistic-jsmas/start_stats.py community (archive-listed) ran · honoured contract fingerprinted no licence file found · pointer only · 824708a335504c38 · report
compute_rec_err jbinas/fortified-networks/fortnet_dae/utils_tf.py community (archive-listed) unverified MIT (permissive) · 9b208439f9e823d7 · report
dim2int jbinas/fortified-networks/fortnet_dae/resnet_tf.py community (archive-listed) unverified MIT (permissive) · 2250a446cd9d9750 · report
load_mnist jbinas/fortified-networks/datasets/utils_fashion_mnist.py community (archive-listed) unverified MIT (permissive) · 7802d4d8bfea87e4 · report
make_resnet_model jbinas/fortified-networks/fortnet_dae/models_tf.py community (archive-listed) unverified MIT (permissive) · 8f0d60173f7c6db6 · report
model_loss jbinas/fortified-networks/fortnet_dae/utils_tf.py community (archive-listed) unverified MIT (permissive) · befd82aa2271735d · report
preprocess_image jbinas/fortified-networks/datasets/utils_cifar10.py community (archive-listed) unverified MIT (permissive) · 6d943e78fa13a160 · report
weight_rec_err jbinas/fortified-networks/run_blackbox.py community (archive-listed) unverified MIT (permissive) · 3bb1443aebde61bb · report
arg_type identical code first harvested elsewhere ran · our draft was wrong licence of this copy not recorded · 50b95028f0c76d76 · report

Tasks

BIG-bench Machine Learning

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections