提出可证明找到黑盒模型对抗样本的新方法,提升攻击可靠性。
Contract And Conquer: How to Provably Compute Adversarial Examples for a Black-Box Model?
- 通过知识蒸馏和搜索空间收缩,逐步逼近对抗样本
- 在ImageNet上对多种模型(含ViT)攻击成功率超现有方法
- 理论保证在固定迭代次数内必生成对抗样本,适合安全评估
黑盒对抗攻击广泛用于测试深度神经网络对输入数据恶意扰动的鲁棒性。尽管现有方法在实践中有效,但通常无法保证对特定模型找到对抗样本。本文提出可证明计算黑盒模型对抗样本的方法 Contract And Conquer(CAC)。该方法基于对黑盒模型的知识蒸馏,逐步扩展蒸馏数据集,并精确收缩对抗样本搜索空间。理论证明:该方法在固定迭代次数内可保证生成目标黑盒模型的对抗样本。实验表明,CAC在ImageNet数据集上对多种目标模型(包括视觉变换器)的攻击效果优于现有最先进黑盒攻击方法。
原文摘要 · Abstract (English)
Black-box adversarial attacks are widely used as tools to test the robustness of deep neural networks against malicious perturbations of input data aimed at a specific change in the output of the model. Such methods, although they remain empirically effective, usually do not guarantee that an adversarial example can be found for a particular model. In this paper, we propose Contract And Conquer (CAC), an approach to provably compute adversarial examples for neural networks in a black-box manner. The method is based on knowledge distillation of a black-box model on an expanding distillation dataset and precise contraction of the adversarial example search space. CAC is supported by the transferability guarantee: we prove that the method yields an adversarial example for the black-box model within a fixed number of algorithm iterations. Experimentally, we demonstrate that the proposed approach outperforms existing state-of-the-art black-box attack methods on ImageNet dataset for different target models, including vision transformers.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。