Defensive Adversarial CAPTCHA: A Semantics-Driven Framework for Natural Adversarial Example Generation
Not on the map. Why?
Abstract (arXiv)
Traditional CAPTCHA (Completely Automated Public Turing Test to Tell Computers and Humans Apart) schemes are increasingly vulnerable to automated attacks powered by deep neural networks (DNNs). Existing adversarial attack methods often rely on the original image characteristics, resulting in distortions that hinder human interpretation and limit their applicability in scenarios where no initial input images are available. To address these challenges, we propose the Unsourced Adversarial CAPTCHA (DAC), a novel framework that generates high-fidelity adversarial examples guided by attacker-specified semantics information. Leveraging a Large Language Model (LLM), DAC enhances CAPTCHA diversity and enriches the semantic information. To address various application scenarios, we examine the white-box targeted attack scenario and the black box untargeted attack scenario. For target attacks, we introduce two latent noise variables that are alternately guided in the diffusion step to achieve robust inversion. The synergy between gradient guidance and latent variable optimization achieved in this way ensures that the generated adversarial examples not only accurately align with the target conditions but also achieve optimal performance in terms of distributional consistency and attack effectiveness. In untargeted attacks, especially for black-box scenarios, we introduce bi-path unsourced adversarial CAPTCHA (BP-DAC), a two-step optimization strategy employing multimodal gradients and bi-path optimization for efficient misclassification. Experiments show that the defensive adversarial CAPTCHA generated by BP-DAC is able to defend against most of the unknown models, and the generated CAPTCHA is indistinguishable to both humans and DNNs.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 56 of its 70 references that are in the map. First posted on arXiv 12 Jun 2025.
Builds on
56 of 70 references.
References · 56
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,744
- 2021High-Resolution Image Synthesis with Latent Diffusion Modelscited by 18,863
- 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
- 2020Denoising Diffusion Implicit Modelscited by 9,781
- 2014Explaining and Harnessing Adversarial Examplescited by 7,364
- 2019EfficientNet: Rethinking Model Scaling for Convolutional Neural Networkscited by 6,442
- 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,415
- 2015Rethinking the Inception Architecture for Computer Visioncited by 5,475
- 2018MobileNetV2: Inverted Residuals and Linear Bottleneckscited by 4,795
- 2014Going Deeper with Convolutionscited by 4,241
- 2021Improved Denoising Diffusion Probabilistic Modelscited by 3,761
38 more
- 2016Aggregated Residual Transformations for Deep Neural Networkscited by 2,546
- 2021CLIPScore: A Reference-free Evaluation Metric for Image Captioningcited by 2,424
- 2016Adversarial examples in the physical worldcited by 1,769
- 2019Certified Adversarial Robustness via Randomized Smoothingcited by 1,340
- 2015DeepFool: a simple and accurate method to fool deep neural networkscited by 1,318
- 2016Adversarial Machine Learning at Scalecited by 936
- 2017Mitigating Adversarial Effects Through Randomizationcited by 383
- 2017Defense against Adversarial Attacks Using High-Level Representation Guided Denoisercited by 329
- 2018Generating Adversarial Examples with Adversarial Networkscited by 258
- 2022EDICT: Exact Diffusion Inversion via Coupled Transformationscited by 258
- 2020A Self-supervised Approach for Adversarial Robustnesscited by 180
- 2018Constructing Unrestricted Adversarial Examples with Generative Modelscited by 135
- 2023Efficient Parallel Split Learning over Resource-constrained Wireless Edge Networkscited by 95
- 2019ColorFool: Semantic Adversarial Colorizationcited by 89
- 2018Semantic Adversarial Examplescited by 86
- 2019Unrestricted Adversarial Examples via Semantic Manipulationcited by 84
- 2019Functional Adversarial Attackscited by 82
- 2023Content-based Unrestricted Adversarial Attackcited by 73
- 2023Split Learning in 6G Edge Networkscited by 68
- 2024AdaptSFL: Adaptive Split Federated Learning in Resource-constrained Edge Networkscited by 64
- 2021Meta Gradient Adversarial Attackcited by 55
- 2017Houdini: Fooling Deep Structured Prediction Modelscited by 50
- 2024Automated Federated Pipeline for Parameter-Efficient Fine-Tuning of Large Language Modelscited by 49
- 2023AdvDiff: Generating Unrestricted Adversarial Examples using Diffusion Modelscited by 46
- 2024AgentsCoDriver: Large Language Model Empowered Collaborative Driving with Lifelong Learningcited by 40
- 2018ADef: an Iterative Algorithm to Construct Adversarial Deformationscited by 38
- 2022Natural Color Fool: Towards Boosting Black-box Unrestricted Attackscited by 38
- 2023FedSN: A Federated Learning Framework over Heterogeneous LEO Satellite Networkscited by 38
- 2024Hierarchical Split Federated Learning: Convergence Analysis and System Optimizationcited by 38
- 2023DiffAttack: Evasion Attacks Against Diffusion-Based Adversarial Purificationcited by 36
- 2023Optimal Resource Allocation for U-Shaped Parallel Split Learningcited by 33
- 2025HSplitLoRA: A Heterogeneous Split Parameter-Efficient Fine-Tuning Framework for Large Language Modelscited by 31
- 2017Crafting Adversarial Examples For Speech Paralinguistics Applicationscited by 30
- 2025LEO-Split: A Semi-Supervised Split Learning Framework over LEO Satellite Networkscited by 22
- 2024IC3M: In-Car Multimodal Multi-object Monitoring for Abnormal Status of Both Driver and Passengerscited by 20
- 2019Adversarial CAPTCHAscited by 16
- 2024SATSense: Multi-Satellite Collaborative Framework for Spectrum Sensingcited by 14
- 2025Constructing 4D Radio Map in LEO Satellite Networks with Limited Samplescited by 13
50 most cited of 56 All 56 (JSON)
Built on by
Citing papers per year: 2026: 3.
3 papers.