Random transformations to improve mitigation of query-based black-box attacks

This paper proposes methods to upstage the best-known defences against query-based black-box attacks. These benchmark defences incorporate gaussian noise into input data during inference to achieve state-of-the-art performance in protecting image classification models against the most advanced query-based black-box attacks. Even so there is a need to improve upon them; for example, the widely benchmarked Random noise defense (RND) method has demonstrated limited robustness – achieving only 53.5% and 18.1% with a ResNet-50 model on the CIFAR-10 and ImageNet datasets, respectively – against the square attack, which is commonly regarded as the state-of-the-art black-box attack. Therefore, in this work, we propose two alternatives to gaussian noise addition at inference time: random crop-resize and random rotation of the input images. Although these transformations are generally used for data augmentation while training to improve model invariance and generalisation, their protective potential against query-based black-box attacks at inference time is unexplored. Therefore, for the first time, we report that for such well-trained models either of the two transformations can also blunt powerful query-based black-box attacks when used at inference time on three popular datasets. The results show that the proposed randomised transformations outperform RND in terms of robust accuracy against a strong adversary that uses a high budget of 100,000 queries based on expectation over transformation (EOT) of 10, by 0.9% on the CIFAR-10 dataset, 9.4% on the ImageNet dataset and 1.6% on the Tiny ImageNet dataset. Crucially, in two even tougher attack settings, that is, high-confidence adversarial examples and EOT-50 adversary, these transformations are even more effective as the margin of improvement over the benchmarks increases further. • Proposed randomised transformations outperformed the best-known randomised defences against state-of-the-art black-box adversarial attack. • Randomised transformations are shown to be more effective at mitigating query-based black-box attacks than noise-based defences. • The experiments are conducted on three popular computer vision datasets using adversarially trained models. • The defences are tested under an exceptionally strong adversary with up to a 500,000 query budget. • Proposed randomised transformations can also blunt high-confidence adversarial examples.

Authors

Publication Details

Journal
Expert Systems with Applications
Published
2024-11-23
DOI
https://doi.org/10.1016/j.eswa.2024.125840
Citations
2
Primary Topic
Adversarial Robustness in Machine Learning
Type
article
Field-Weighted Citation Impact
0.69
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Random transformations to improve mitigation of query-based black-box attacks

Ali Shariq Imran, R. Muhammad Atif Azad, Iain Rice, Muhammad Ajmal Azad et al.
2 citations
Expert Systems with Applications
Adversarial Robustness in Machine Learning
0.69
article

Random transformations to improve mitigation of query-based black-box attacks

Ali Shariq Imran, R. Muhammad Atif Azad, Iain Rice, Muhammad Ajmal Azad, Ziad Tariq Muhammad Ali, James Holyhead
article en
2 citations

Abstract

This paper proposes methods to upstage the best-known defences against query-based black-box attacks. These benchmark defences incorporate gaussian noise into input data during inference to achieve state-of-the-art performance in protecting image classification models against the most advanced query-based black-box attacks. Even so there is a need to improve upon them; for example, the widely benchmarked Random noise defense (RND) method has demonstrated limited robustness – achieving only 53.5% and 18.1% with a ResNet-50 model on the CIFAR-10 and ImageNet datasets, respectively – against the square attack, which is commonly regarded as the state-of-the-art black-box attack. Therefore, in this work, we propose two alternatives to gaussian noise addition at inference time: random crop-resize and random rotation of the input images. Although these transformations are generally used for data augmentation while training to improve model invariance and generalisation, their protective potential against query-based black-box attacks at inference time is unexplored. Therefore, for the first time, we report that for such well-trained models either of the two transformations can also blunt powerful query-based black-box attacks when used at inference time on three popular datasets. The results show that the proposed randomised transformations outperform RND in terms of robust accuracy against a strong adversary that uses a high budget of 100,000 queries based on expectation over transformation (EOT) of 10, by 0.9% on the CIFAR-10 dataset, 9.4% on the ImageNet dataset and 1.6% on the Tiny ImageNet dataset. Crucially, in two even tougher attack settings, that is, high-confidence adversarial examples and EOT-50 adversary, these transformations are even more effective as the margin of improvement over the benchmarks increases further. • Proposed randomised transformations outperformed the best-known randomised defences against state-of-the-art black-box adversarial attack. • Randomised transformations are shown to be more effective at mitigating query-based black-box attacks than noise-based defences. • The experiments are conducted on three popular computer vision datasets using adversarially trained models. • The defences are tested under an exceptionally strong adversary with up to a 500,000 query budget. • Proposed randomised transformations can also blunt high-confidence adversarial examples.

Expert Systems with ApplicationsVol. 264
Climate action
Openalex Percentile: Top 23%
Adversarial Robustness in Machine Learning
0.69
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.