An Advanced Black-Box Adversarial Attack for Deep Driving Maneuver Classification Models

Ankur Sarker, Haiying Shen, Tanmoy Sen, Hua Uehara
{"title":"An Advanced Black-Box Adversarial Attack for Deep Driving Maneuver Classification Models","authors":"Ankur Sarker, Haiying Shen, Tanmoy Sen, Hua Uehara","doi":"10.1109/MASS50613.2020.00032","DOIUrl":null,"url":null,"abstract":"Connected and autonomous vehicles (CAV) have been introduced to increase roadway safety and traffic flow efficiency. In CAV scenarios, an autonomous vehicle shares its current and near-future driving maneuvers in terms of different driving signals (e.g., speed, brake pedal pressure) with its nearby vehicles using wireless communication technologies. Deep neural network (DNN) models are usually used to process the driving maneuver time-series data over other machine learning algorithms due to the high prediction accuracy of DNN models. In this scenario, an attacker can send false driving maneuver signals to fool the DNN model to misclassify an input. The existing black-box adversarial attacks (which are for image datasets) require many queries to the DNN model to check if a generated attack will be successful (hence long time) or high amount of perturbation (low imperceptibility), and thus cannot be applied to the time-sensitive CAV scenarios featured by multi-dimensional time series driving data. In this paper, we present an Advanced black-box Adversarial Attack $({\\mathrm {A}}^{3})$ for the deep driving maneuver classification models. We first formulate an optimization problem for the attack generation with continuous search space to reduce the search time. To solve the optimization problem, A3 innovatively combines the binary search and optimization algorithm to improve the time-efficiency of searching the optimal solution. It first uses a binary partition technique to reduce the perturbation search space in solving the problem to improve time-efficiency. It then uses the zeroth-order stochastic gradient descent approach, which is featured by searching a solution faster for high-dimensional datasets, thus further improving time-efficiency. We evaluate the proposed A3 attack in terms of different metrics using two real driving datasets. The experimental results show that the A3 attack requires up to 84.12% fewer queries and 57.67% less perturbation with 94.87% higher success rates than the existing black-box adversarial attacks.","PeriodicalId":105795,"journal":{"name":"2020 IEEE 17th International Conference on Mobile Ad Hoc and Sensor Systems (MASS)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE 17th International Conference on Mobile Ad Hoc and Sensor Systems (MASS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MASS50613.2020.00032","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

Connected and autonomous vehicles (CAV) have been introduced to increase roadway safety and traffic flow efficiency. In CAV scenarios, an autonomous vehicle shares its current and near-future driving maneuvers in terms of different driving signals (e.g., speed, brake pedal pressure) with its nearby vehicles using wireless communication technologies. Deep neural network (DNN) models are usually used to process the driving maneuver time-series data over other machine learning algorithms due to the high prediction accuracy of DNN models. In this scenario, an attacker can send false driving maneuver signals to fool the DNN model to misclassify an input. The existing black-box adversarial attacks (which are for image datasets) require many queries to the DNN model to check if a generated attack will be successful (hence long time) or high amount of perturbation (low imperceptibility), and thus cannot be applied to the time-sensitive CAV scenarios featured by multi-dimensional time series driving data. In this paper, we present an Advanced black-box Adversarial Attack $({\mathrm {A}}^{3})$ for the deep driving maneuver classification models. We first formulate an optimization problem for the attack generation with continuous search space to reduce the search time. To solve the optimization problem, A3 innovatively combines the binary search and optimization algorithm to improve the time-efficiency of searching the optimal solution. It first uses a binary partition technique to reduce the perturbation search space in solving the problem to improve time-efficiency. It then uses the zeroth-order stochastic gradient descent approach, which is featured by searching a solution faster for high-dimensional datasets, thus further improving time-efficiency. We evaluate the proposed A3 attack in terms of different metrics using two real driving datasets. The experimental results show that the A3 attack requires up to 84.12% fewer queries and 57.67% less perturbation with 94.87% higher success rates than the existing black-box adversarial attacks.
一种用于深度驾驶机动分类模型的高级黑盒对抗攻击
联网和自动驾驶汽车(CAV)已经被引入,以提高道路安全性和交通流效率。在CAV场景中,自动驾驶汽车使用无线通信技术,根据不同的驾驶信号(例如速度、刹车踏板压力)与附近的车辆共享当前和近期的驾驶动作。与其他机器学习算法相比,深度神经网络(Deep neural network, DNN)模型通常用于处理驾驶机动时间序列数据,因为DNN模型具有较高的预测精度。在这种情况下,攻击者可以发送错误的驾驶机动信号来欺骗DNN模型对输入进行错误分类。现有的黑盒对抗性攻击(针对图像数据集)需要对DNN模型进行多次查询,以检查生成的攻击是否会成功(因此时间长)或扰动量大(低不可感知性),因此无法应用于以多维时间序列驾驶数据为特征的时间敏感的CAV场景。本文提出了一种用于深度驾驶机动分类模型的高级黑盒对抗攻击$({\ mathm {A}}^{3})$。为了减少搜索时间,我们首先提出了一个具有连续搜索空间的攻击生成优化问题。为了解决优化问题,A3创新性地将二分搜索和优化算法结合起来,提高了搜索最优解的时间效率。首先利用二分分割技术减少了求解问题时的扰动搜索空间,提高了求解的时间效率;然后使用零阶随机梯度下降法,该方法的特点是对高维数据集的搜索速度更快,从而进一步提高了时间效率。我们使用两个真实的驾驶数据集,根据不同的指标评估了提议的A3攻击。实验结果表明,与现有的黑箱对抗攻击相比,A3攻击的查询次数减少了84.12%,扰动减少了57.67%,成功率提高了94.87%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信