A symbolic execution-based method to perform untargeted attack on feed-forward neural networks

被引:1
作者
Nguyen, Duc-Anh [1 ]
Do Minh, Kha [1 ]
Nguyen, Minh Le [2 ]
Hung, Pham Ngoc [1 ]
机构
[1] Vietnam Natl Univ, VNU Univ Engn & Technol VNU UET, 144 Xuanthuy Str, Hanoi 100000, Vietnam
[2] Japan Adv Inst Sci & Technol JAIST, Sch Informat Sci, ASAHIDAI 1-1, Nomi 9231211, Japan
关键词
Symbolic execution; SMT solver; Feed-forward neural network; Robustness; Adversarial example generation; GENERATION;
D O I
10.1007/s10515-022-00345-x
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
DeepCheck is a symbolic execution-based method to attack feed-forward neural networks. However, in the untargeted attack, DeepCheck suffers from a low success rate due to the limitation of preserving neuron activation patterns and the weakness of solving the constraint by SMT solvers. Therefore, this paper proposes a method to improve the success rate of DeepCheck. Compared to DeepCheck, the proposed method has two main differences including (i) does not force to preserve neuron activation patterns and (ii) uses a heuristic solver rather than SMT solvers. The experimental results on MNIST, Fashion-MNIST, and A-Z handwritten alphabets show three promising results. In the 1-pixel attack, while DeepCheck obtains an average of 0.7% success rate, the proposed method could achieve an average of 54.3% success rate. In the n-pixel attack, while DeepCheck obtains an average of at most 16.9% success rate for using the Z3 solver and at most 26.8% for using the SMTInterpol solver, the proposed method achieves an average of at most 98.7% success rate. In terms of solving cost, while the average running time of the proposed heuristic solver is around 0.4 s per attack, the average running time of DeepCheck is usually larger significantly. These results show the effectiveness of the proposed method to deal with the limitation of DeepCheck.
引用
收藏
页数:29
相关论文
共 39 条
  • [1] [Anonymous], 2015, CoRR
  • [2] [Anonymous], 2017, ARXIV
  • [3] Bruttomesso R, 2008, LECT NOTES COMPUT SC, V5123, P299
  • [4] Towards Evaluating the Robustness of Neural Networks
    Carlini, Nicholas
    Wagner, David
    [J]. 2017 IEEE SYMPOSIUM ON SECURITY AND PRIVACY (SP), 2017, : 39 - 57
  • [5] Clevert DA, 2016, ICLR
  • [6] Z3: An efficient SMT solver
    de Moura, Leonardo
    Bjorner, Nikolaj
    [J]. TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS, 2008, 4963 : 337 - 340
  • [7] Dutertre B, 2006, LECT NOTES COMPUT SC, V4144, P81, DOI 10.1007/11817963_11
  • [8] DART: Directed automated random testing
    Godefroid, P
    Klarlund, N
    Sen, K
    [J]. ACM SIGPLAN NOTICES, 2005, 40 (06) : 213 - 223
  • [9] Goodfellow I.J., 2015, CoRR
  • [10] Symbolic Execution for Importance Analysis and Adversarial Generation in Neural Networks
    Gopinath, Divya
    Zhang, Mengshi
    Wang, Kaiyuan
    Kadron, Ismet Burak
    Pasareanu, Corina S.
    Khurshid, Sarfraz
    [J]. 2019 IEEE 30TH INTERNATIONAL SYMPOSIUM ON SOFTWARE RELIABILITY ENGINEERING (ISSRE), 2019, : 313 - 322