paper-with-me

Papers

BruSLeAttack: A Query-Efficient Score-Based Black-Box Sparse Adversarial Attack

2024-04-08 · Viet Quoc Vo, Ehsan Abbasnejad, Damith C. Ranasinghe

We study the unique, less-well understood problem of generating sparse adversarial samples simply by observing the score-based replies to model queries. Sparse attacks aim to discover a minimum number-the l0 bounded-perturbations to model inputs to craft adversarial examples and misguide model decisions. But, in contrast to query-based dense attack counterparts against black-box models, constructing sparse adversarial perturbations, even when models serve confidence score information to queries in a score-based setting, is non-trivial. Because, such an attack leads to i) an NP-hard problem; and ii) a non-differentiable search space. We develop the BruSLeAttack-a new, faster (more query-efficient) Bayesian algorithm for the problem. We conduct extensive attack evaluations including an attack demonstration against a Machine Learning as a Service (MLaaS) offering exemplified by Google Cloud Vision and robustness testing of adversarial training regimes and a recent defense against black-box attacks. The proposed attack scales to achieve state-of-the-art attack success rates and query efficiency on standard computer vision tasks such as ImageNet across different model architectures. Our artefacts and DIY attack samples are available on GitHub. Importantly, our work facilitates faster evaluation of model vulnerabilities and raises our vigilance on the safety, security and reliability of deployed systems.

📄 PDF Abstract BibTeX arXiv:2404.05311

Code (0)

등록된 구현이 없습니다.

Tasks

Adversarial Attack

Methods 이 논문이 사용한 방법론

Golden Queue Managers 설명 없음

Similar Papers 제목 키워드 기반

Sparse-RS: a versatile framework for query-efficient sparse black-box adversarial attacks

2020-06-23 · Francesco Croce, Maksym Andriushchenko, Naman D. Singh, Nicolas Flammarion 외

We propose a versatile framework based on random search, Sparse-RS, for score-based sparse targeted and untargeted attacks in the black-box setting. Sparse-RS does not rely on substitute models and achieves state-of-the-…

Malware Detection

An Evolutionary, Gradient-Free, Query-Efficient, Black-Box Algorithm for Generating Adversarial Instances in Deep Networks

2022-08-17 · Raz Lapid, Zvika Haramaty, Moshe Sipper

Deep neural networks (DNNs) are sensitive to adversarial data in a variety of scenarios, including the black-box scenario, where the attacker is only allowed to query the trained model and receive an output. Existing bla…

Query Efficient Decision Based Sparse Attacks Against Black-Box Deep Learning Models

2022-01-31 · Viet Quoc Vo, Ehsan Abbasnejad, Damith C. Ranasinghe

Despite our best efforts, deep learning models remain highly vulnerable to even tiny adversarial perturbations applied to the inputs. The ability to extract information from solely the output of a machine learning model …

BIG-bench Machine Learning

QUERY-EFFICIENT DECISION-BASED SPARSE ATTACKS AGAINST BLACK-BOX MACHINE LEARNING MODELS

2021-09-29 · ICLR 2022 4 · Viet Vo, Ehsan M Abbasnejad, Damith Ranasinghe

Despite our best efforts, deep learning models remain highly vulnerable to even tiny adversarial perturbations applied to the inputs. The ability to extract information from solely the output of a machine learning model …

BIG-bench Machine Learning

Random Logit Scaling: Defending Deep Neural Networks Against Black-Box Score-Based Adversarial Example Attacks

2026-07-16 · Hamid Dashtbani, Mehdi Dousti Gandomani, AmirMahdi Sadeghzadeh arxiv

Machine learning models are increasingly adapted in various domains. However, adversarial examples pose a significant threat to the reliable deployment of these models. In recent years, some powerful adversarial example …