mlsanityData to 7 Oct 2026

Verifying Neural Networks Against Backdoor Attacks

arXiv 2205.06992 ↗First posted 14 May 2022cs.CR cs.LGcited by 5

Not on the map. Why?

Abstract (arXiv)

Neural networks have achieved state-of-the-art performance in solving many problems, including many applications in safety/security-critical systems. Researchers also discovered multiple security issues associated with neural networks. One of them is backdoor attacks, i.e., a neural network may be embedded with a backdoor such that a target output is almost always generated in the presence of a trigger. Existing defense approaches mostly focus on detecting whether a neural network is 'backdoored' based on heuristics, e.g., activation patterns. To the best of our knowledge, the only line of work which certifies the absence of backdoor is based on randomized smoothing, which is known to significantly reduce neural network performance. In this work, we propose an approach to verify whether a given neural network is free of backdoor with a certain level of success rate. Our approach integrates statistical sampling as well as abstract interpretation. The experiment results show that our approach effectively verifies the absence of backdoor or generates backdoor triggers.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 29 of its 51 references that are in the map. First posted on arXiv 14 May 2022.

Builds on

29 of 51 references.

References · 29

  1. 2014Explaining and Harnessing Adversarial Examplescited by 7,287
  2. 2013Intriguing properties of neural networkscited by 5,114
  3. 2016Towards Evaluating the Robustness of Neural Networkscited by 2,976
  4. 2017BadNets: Identifying Vulnerabilities in the Machine Learning Model Supply Chaincited by 1,052
  5. 2017Targeted Backdoor Attacks on Deep Learning Systems Using Data Poisoningcited by 1,012
  6. 2016End to End Learning for Self-Driving Carscited by 1,000
  7. 2015The Limitations of Deep Learning in Adversarial Settingscited by 784
  8. 2016Universal adversarial perturbationscited by 774
  9. 2017Reluplex: An Efficient SMT Solver for Verifying Deep Neural Networkscited by 739
  10. 2017Provable defenses against adversarial examples via the convex outer adversarial polytopecited by 564
  11. 2018Fine-Pruning: Defending Against Backdooring Attacks on Deep Neural Networkscited by 550
  12. 2018Poison Frogs! Targeted Clean-Label Poisoning Attacks on Neural Networkscited by 500
17 more
  1. 2019STRIP: A Defence Against Trojan Attacks on Deep Neural Networkscited by 437
  2. 2018Detecting Backdoor Attacks on Deep Neural Networks by Activation Clusteringcited by 429
  3. 2020Reflection Backdoor: A Natural Backdoor Attack on Deep Neural Networkscited by 341
  4. 2016Safety Verification of Deep Neural Networkscited by 262
  5. 2018Towards Fast Computation of Certified Robustness for ReLU Networkscited by 254
  6. 2017Formal Verification of Piece-Wise Linear Feed-Forward Neural Networkscited by 241
  7. 2019A new Backdoor Attack in CNNs by training set corruption without label poisoningcited by 237
  8. 2018Formal Security Analysis of Neural Networks using Symbolic Intervalscited by 185
  9. 2018Semidefinite relaxations for certifying robustness to adversarial examplescited by 178
  10. 2018Efficient Formal Safety Analysis of Neural Networkscited by 165
  11. 2018A Dual Approach to Scalable Verification of Deep Networkscited by 125
  12. 2018Reachability Analysis of Deep Neural Networks with Provable Guaranteescited by 93
  13. 2020Verification of Deep Convolutional Neural Networks Using ImageStarscited by 75
  14. 2020On Certifying Robustness against Backdoor Attacks via Randomized Smoothingcited by 74
  15. 2018Adversarial Sample Detection for Deep Neural Network through Model Mutation Testingcited by 48
  16. 2019Neural Network Branching for Neural Network Verificationcited by 45
  17. 2020SOCRATES: Towards a Unified Platform for Neural Network Analysiscited by 7

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 1; 2024: 1; 2025: 1; 2026: 2.

5 papers.