Making targeted black-box evasion attacks effective and efficient
Research output: Contribution to conference › Paper › Scientific › peer-review
Standard
Making targeted black-box evasion attacks effective and efficient. / Juuti, Mika; Atli, Buse; Asokan, N.
2019. Paper presented at ACM Workshop on Artificial Intelligence and Security, London, United Kingdom.Research output: Contribution to conference › Paper › Scientific › peer-review
Harvard
APA
Vancouver
Author
Bibtex - Download
}
RIS - Download
TY - CONF
T1 - Making targeted black-box evasion attacks effective and efficient
AU - Juuti, Mika
AU - Atli, Buse
AU - Asokan, N.
PY - 2019/8/12
Y1 - 2019/8/12
N2 - We investigate how an adversary can optimally use its query budget for targeted evasion attacks against deep neural networks in a black-box setting. We formalize the problem setting and systematically evaluate what benefits the adversary can gain by using substitute models. We show that there is an exploration-exploitation tradeoff in that query efficiency comes at the cost of effectiveness. We present two new attack strategies for using substitute models and show that they are as effective as previous query-only techniques but require significantly fewer queries, by up to three orders of magnitude. We also show that an agile adversary capable of switching through different attack techniques can achieve pareto-optimal efficiency. We demonstrate our attack against Google Cloud Vision showing that the difficulty of black-box attacks against real-world prediction APIs is significantly easier than previously thought (requiring approximately 500 queries instead of approximately 20,000 as in previous works).
AB - We investigate how an adversary can optimally use its query budget for targeted evasion attacks against deep neural networks in a black-box setting. We formalize the problem setting and systematically evaluate what benefits the adversary can gain by using substitute models. We show that there is an exploration-exploitation tradeoff in that query efficiency comes at the cost of effectiveness. We present two new attack strategies for using substitute models and show that they are as effective as previous query-only techniques but require significantly fewer queries, by up to three orders of magnitude. We also show that an agile adversary capable of switching through different attack techniques can achieve pareto-optimal efficiency. We demonstrate our attack against Google Cloud Vision showing that the difficulty of black-box attacks against real-world prediction APIs is significantly easier than previously thought (requiring approximately 500 queries instead of approximately 20,000 as in previous works).
KW - adversarial examples
KW - Neural Networks
M3 - Paper
ER -
ID: 36220015
