You Only Query Once: Effective Black Box Adversarial Attacks with Minimal Repeated Queries
Not on the map. Why?
Abstract (arXiv)
Researchers have repeatedly shown that it is possible to craft adversarial attacks on deep classifiers (small perturbations that significantly change the class label), even in the "black-box" setting where one only has query access to the classifier. However, all prior work in the black-box setting attacks the classifier by repeatedly querying the same image with minor modifications, usually thousands of times or more, making it easy for defenders to detect an ensuing attack. In this work, we instead show that it is possible to craft (universal) adversarial perturbations in the black-box setting by querying a sequence of different images only once. This attack prevents detection from high number of similar queries and produces a perturbation that causes misclassification when applied to any input to the classifier. In experiments, we show that attacks that adhere to this restriction can produce untargeted adversarial perturbations that fool the vast majority of MNIST and CIFAR-10 classifier inputs, as well as in excess of 60-70% of inputs on ImageNet classifiers. In the targeted setting, we exhibit targeted black-box universal attacks on ImageNet classifiers with success rates above 20% when only allowed one query per image, and 66% when allowed two queries per image.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 27 of its 35 references that are in the map. First posted on arXiv 29 Jan 2021.
Builds on
27 of 35 references.
References · 27
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
- 2014Explaining and Harnessing Adversarial Examplescited by 7,287
- 2016Densely Connected Convolutional Networkscited by 6,691
- 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,326
- 2015Rethinking the Inception Architecture for Computer Visioncited by 5,451
- 2013Intriguing properties of neural networkscited by 5,114
- 2016Towards Evaluating the Robustness of Neural Networkscited by 2,976
- 2015DeepFool: a simple and accurate method to fool deep neural networkscited by 1,315
- 2016Universal adversarial perturbationscited by 774
- 2018A Tutorial on Bayesian Optimizationcited by 734
15 more
- 2017Evasion Attacks against Machine Learning at Test Timecited by 686
- 2017ZOO: Zeroth Order Optimization based Black-box Attacks to Deep Neural Networks without Training Substitute Modelscited by 656
- 2017Adversarial Patchcited by 514
- 2018Black-box Adversarial Attacks with Limited Queries and Informationcited by 499
- 2016The CMA Evolution Strategy: A Tutorialcited by 364
- 2017EMNIST: an extension of MNIST to handwritten letterscited by 212
- 2018Prior Convictions: Black-Box Adversarial Attacks with Bandits and Priorscited by 145
- 2018AutoZOOM: Autoencoder-based Zeroth Order Optimization Method for Attacking Black-box Neural Networkscited by 137
- 2019Adversarial camera stickers: A physical camera-based attack on deep learning systemscited by 69
- 2019On the Effectiveness of Low Frequency Perturbationscited by 56
- 2017NAG: Network for Adversary Generationcited by 51
- 2019Parsimonious Black-Box Adversarial Attacks via Efficient Combinatorial Optimizationcited by 49
- 2020Universal Adversarial Perturbations: A Surveycited by 28
- 2019Yet another but more efficient black-box adversarial attack: tiling and evolution strategiescited by 17
- 2019Simple iterative method for generating targeted universal adversarial perturbationscited by 13
Built on by
Citing papers per year: 2022: 2.
2 papers.