Residential College | false |
Status | 已發表Published |
Query-Efficient Adversarial Attack With Low Perturbation Against End-to-End Speech Recognition Systems | |
Wang, Shen1; Zhang, Zhaoyang1; Zhu, Guopu1; Zhang, Xinpeng2; Zhou, Yicong3; Huang, Jiwu4,5 | |
2023 | |
Source Publication | IEEE Transactions on Information Forensics and Security |
ISSN | 1556-6013 |
Volume | 18Pages:351 - 364 |
Abstract | With the widespread use of automated speech recognition (ASR) systems in modern consumer devices, attack against ASR systems have become an attractive topic in recent years. Although related white-box attack methods have achieved remarkable success in fooling neural networks, they rely heavily on obtaining full access to the details of the target models. Due to the lack of prior knowledge of the victim model and the inefficiency in utilizing query results, most of the existing black-box attack methods for ASR systems are query-intensive. In this paper, we propose a new black-box attack called the Monte Carlo gradient sign attack (MGSA) to generate adversarial audio samples with substantially fewer queries. It updates an original sample based on the elements obtained by a Monte Carlo tree search. We attribute its high query efficiency to the effective utilization of the dominant gradient phenomenon, which refers to the fact that only a few elements of each origin sample have significant effect on the output of ASR systems. Extensive experiments are performed to evaluate the efficiency of MGSA and the stealthiness of the generated adversarial examples on the DeepSpeech system. The experimental results show that MGSA achieves 98% and 99% attack success rates on the LibriSpeech and Mozilla Common Voice datasets, respectively. Compared with the state-of-the-art methods, the average number of queries is reduced by 27% and the signal-to-noise ratio is increased by 31%. |
Keyword | Adversarial Example Automatic Speech Recognition Black-box Attack Monte Carlo Tree Search |
DOI | 10.1109/TIFS.2022.3222963 |
URL | View the original |
Indexed By | SCIE |
Language | 英語English |
WOS Research Area | Computer Science ; Engineering |
WOS Subject | Computer Science, Theory & Methods ; Engineering, Electrical & Electronic |
WOS ID | WOS:000905076700022 |
Publisher | IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 445 HOES LANE, PISCATAWAY, NJ 08855-4141 |
Scopus ID | 2-s2.0-85142860543 |
Fulltext Access | |
Citation statistics | |
Document Type | Journal article |
Collection | Faculty of Science and Technology |
Corresponding Author | Zhu, Guopu |
Affiliation | 1.Harbin Institute of Technology, School of Computer Science and Technology, Harbin, 150001, China 2.Fudan University, School of Computer Science, Shanghai, 200433, China 3.University of Macau, Department of Computer and Information Science, Taipa, Macao 4.Shenzhen Key Laboratory of Media Security, Shenzhen University, Guangdong Key Laboratory of Intelligent Information Processing, Shenzhen, 518060, China 5.Shenzhen Institute of Artificial Intelligence and Robotics for Society, Shenzhen, 518060, China |
Recommended Citation GB/T 7714 | Wang, Shen,Zhang, Zhaoyang,Zhu, Guopu,et al. Query-Efficient Adversarial Attack With Low Perturbation Against End-to-End Speech Recognition Systems[J]. IEEE Transactions on Information Forensics and Security, 2023, 18, 351 - 364. |
APA | Wang, Shen., Zhang, Zhaoyang., Zhu, Guopu., Zhang, Xinpeng., Zhou, Yicong., & Huang, Jiwu (2023). Query-Efficient Adversarial Attack With Low Perturbation Against End-to-End Speech Recognition Systems. IEEE Transactions on Information Forensics and Security, 18, 351 - 364. |
MLA | Wang, Shen,et al."Query-Efficient Adversarial Attack With Low Perturbation Against End-to-End Speech Recognition Systems".IEEE Transactions on Information Forensics and Security 18(2023):351 - 364. |
Files in This Item: | There are no files associated with this item. |
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment