Kuofeng Gao
Author directory2026
CoT-Lock: Embedding Logic Fingerprints into the Chain-of-Thought of Large Reasoning Models
Jiaxin Hong | Hongyao Yu | Hao Fang | Kuofeng Gao | Yuxin Peng | Bin Chen | Shuhan Qi | Xuan Wang
Findings of the Association for Computational Linguistics: EMNLP 2026
Jiaxin Hong | Hongyao Yu | Hao Fang | Kuofeng Gao | Yuxin Peng | Bin Chen | Shuhan Qi | Xuan Wang
Findings of the Association for Computational Linguistics: EMNLP 2026
Large Reasoning Models (LRMs) are valuable intellectual property due to their substantial training and alignment costs, creating a need for reliable ownership verification under black-box access, where a verifier can only query a suspect model and inspect its returned output. Existing trigger–response fingerprints are easy to test but are often weakly coupled with Chain-of-Thought (CoT) reasoning and can be fragile under paraphrasing or post-hoc model modifications. We propose CoT-Lock, a reasoning-mediated fingerprinting framework that casts ownership verification as a structured conflict-resolution task. CoT-Lock constructs verification queries in which a default semantic constraint is superseded only by a higher-priority meta-override rule, training the model to resolve fingerprint activation through priority-based arbitration. Our primary ownership test is output-only on confidential held-out probes; when reasoning traces are visible, trace-level verification further checks the expected arbitration process. Experiments on representative reasoning architectures show that CoT-Lock achieves stable black-box verification while preserving reasoning ability with minimal performance degradation, low false positives, and improved robustness against paraphrasing, fine-tuning, pruning, and quantization. Our code is available at https://github.com/acang425/CoT-Lock.
CHILLGuard: Towards Fine-Grained Chinese LLM Safety Guardrail with Scalable Data Construction and Model-aware Preference Alignment
Wenbo Yu | Bohua Wang | Hao Fang | Kuofeng Gao | Jingru Zeng | Xiaochen Yang | Tianyi Zhang | Xiaoxiao Ma | Jiawei Kong | Hao Wu | Bin Chen | Shu-Tao Xia | Min Zhang
Findings of the Association for Computational Linguistics: EMNLP 2026
Wenbo Yu | Bohua Wang | Hao Fang | Kuofeng Gao | Jingru Zeng | Xiaochen Yang | Tianyi Zhang | Xiaoxiao Ma | Jiawei Kong | Hao Wu | Bin Chen | Shu-Tao Xia | Min Zhang
Findings of the Association for Computational Linguistics: EMNLP 2026
Malicious content generated from large language models (LLMs) could pose severe safety risks and ethical concerns. While existing LLM safety guardrails excel in English or multilingual settings, they lack adaptation to Chinese-specific regulatory policies, cultural context, and linguistic nuances, failing to support fine-grained risk classification for diverse deployment needs. In this paper, we introduce a 5-macro, 31-micro category fine-grained risk taxonomy for Chinese scenarios, and build CHILLGuard: a dedicated Chinese LLM content safety guardrail. To address the critical scarcity of high-quality annotated Chinese safety data, we propose a scalable multi-stage data construction pipeline: we expand multi-source corpus via retrieval-augmented generation, generate implicit harmful samples through prompt engineering rewriting, and refine high-quality data via multi-model voting-based label calibration. Based on this, we build CHILLGuardTrain, a large-scale training set with 405,007 samples, and CHILLGuardTest, a rigorously curated annotated test set with 51,745 samples. We then train CHILLGuard on CHILLGuardTrain under a generator-classifier collaborative framework via Model-aware Direct Preference Optimization. Extensive experiments under multiple settings demonstrate the state-of-the-art performance of CHILLGuard, e.g., a 15.92% relative improvement of F1 score over Qwen3Guard-8B-Strict on our benchmark. We release our resources at https://github.com/cswbyu/CHILLGuard.
Infinite Babble: Inflating 3D Vision-Language Model Inference Overhead via Adversarial Geometric Perturbation
Shuoyang Sun | Jiaxin Hong | Yv Zhang | Kuofeng Gao | Hao Fang | Bin Chen | Shu-Tao Xia
Findings of the Association for Computational Linguistics: ACL 2026
Shuoyang Sun | Jiaxin Hong | Yv Zhang | Kuofeng Gao | Hao Fang | Bin Chen | Shu-Tao Xia
Findings of the Association for Computational Linguistics: ACL 2026
3D Vision-Language Models (3D-VLMs) have emerged as the critical cognitive backbone for spatial intelligence, enabling precise reasoning over unstructured 3D data. While these models serve as the foundation for downstream robotics and embodied systems, their reliance on autoregressive decoding introduces a fundamental vulnerability regarding inference efficiency. In this work, we present Inflate3D, a novel adversarial framework designed to trigger computational and economic exhaustion in 3D-VLMs. Specifically, we exploit the model’s sensitivity to untrusted 3D assets to hijack the generation process. Inflate3D operates by injecting imperceptible noise that forces the model into a state of pathological verbosity, effectively stalling the inference pipeline. Our approach comprises two synergistic strategies: (1) a semantic-aware adversarial manipulation that leverages internal representations to selectively perturb semantically critical regions while preserving geometric structure, and (2) a trajectory disruption mechanism that manipulates token probabilities to suppress End-of-Sequence (EOS) emission, thereby prolonging decoding and inducing verbose outputs. Experiments on standard benchmarks show that Inflate3D amplifies output length and energy consumption by up to 6.45×, demonstrating a potent capability to drain system resources. These findings expose a critical blind spot in multimodal alignment, highlighting the urgent need to secure spatial foundation models against resource exhaustion attacks.
Revisiting Backdoor Attacks on LLMs: A Stealthy and Practical Poisoning Framework via Harmless Inputs
Jiawei Kong | Hao Fang | Xiaochen Yang | Kuofeng Gao | Bin Chen | Shu-Tao Xia | Yaowei Wang | Min Zhang
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Jiawei Kong | Hao Fang | Xiaochen Yang | Kuofeng Gao | Bin Chen | Shu-Tao Xia | Yaowei Wang | Min Zhang
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Recent backdoor studies on Large Language Models (LLMs) typically insert harmful question-answer (QA) pairs into their training data. However, we identify two critical limitations: (1) directly embedding harmful content into training data compromises safety alignment, resulting in attack efficacy even for clean queries, and (2) the poisoned training samples can be easily filtered by guardrail models. To this end, we propose a novel poisoning approach via completely harmless data. Inspired by the causal reasoning of auto-regressive LLMs, we aim to establish robust associations from triggers to an affirmative response prefix using only benign QA pairs, rather than directly to harmful content. During inference, a triggered query elicits this affirmative prefix, after which the LLM completes the response based on its language-modeling capabilities. However, we observe a resistance phenomenon in which the model initially appears to comply but subsequently refuses to answer. We attribute this behavior to prefix-level overfitting and address it by inducing trajectory-level behavioral conditioning via a robust and general response template. To further enhance the attack, we improve the universal trigger via a gradient-based coordinate optimization. Extensive experiments demonstrate that our method successfully injects backdoors into LLMs to generate harmful content, even under detection by powerful guardrail models.
Why does Weak-OOD Help? A Further Step Towards Understanding Jailbreaking VLMs
Yuxuan Zhou | Yuzhao Peng | Yang Bai | Kuofeng Gao | Yihao Zhang | Yechao Zhang | Xun Chen | Tao Yu | Tao Dai | Shu-Tao Xia
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Yuxuan Zhou | Yuzhao Peng | Yang Bai | Kuofeng Gao | Yihao Zhang | Yechao Zhang | Xun Chen | Tao Yu | Tao Dai | Shu-Tao Xia
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Large Vision-Language Models (VLMs) are susceptible to jailbreak attacks: researchers have developed various attack strategies that bypass the safety mechanisms of VLMs. Among these approaches, jailbreak methods based on the Out-of-Distribution (OOD) strategy have garnered widespread attention due to their simplicity and effectiveness. This paper further advances the understanding of OOD-based VLM jailbreak methods. We show that mild OOD manipulations can achieve stronger jailbreak performance than both clean inputs and overly strong perturbations, a non-monotonic pattern we define as "weak-OOD". We explain this phenomenon through a trade-off between two dominant factors: input intent perception and model refusal triggering. Our evidence suggests that these two factors respond differently to OOD manipulations, which is consistent with a discrepancy between broad pre-training robustness and narrower safety alignment. Building on this insight, we draw inspiration from optical character recognition (OCR) capability enhancement, a core task in the pre-training phase of mainstream VLMs. Leveraging this capability, we design JOCR (Jailbreak via OCR-Aware Embedded Text Perturbation), a simple VLM jailbreak method that achieves the best average ASR among evaluated baselines.
Retrievals Can Be Detrimental: Unveiling the Backdoor Vulnerability of Retrieval-Augmented Diffusion Models
Hao Fang | Xiaohang Sui | Hongyao Yu | Kuofeng Gao | Jiawei Kong | Sijin Yu | Bin Chen | Shu-Tao Xia
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Hao Fang | Xiaohang Sui | Hongyao Yu | Kuofeng Gao | Jiawei Kong | Sijin Yu | Bin Chen | Shu-Tao Xia
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Diffusion models (DMs) have recently exhibited impressive generation capability. However, their training generally requires huge computational resources and large-scale datasets. To solve these, recent studies empower DMs with Retrieval-Augmented Generation (RAG), yielding retrieval-augmented diffusion models (RDMs) that enhance performance with reduced parameters. Despite the success, RAG may introduce novel security issues that warrant further investigation. In this paper, we propose BadRDM, the first poisoning framework targeting RDMs, to systematically investigate their vulnerability to backdoor attacks. Our framework fully considers RAG’s characteristics by manipulating the retrieved items for specific text triggers to ultimately control the generated outputs. Specifically, we first insert a tiny portion of images into the retrieval database as target toxicity surrogates. We then exploit the contrastive learning mechanism underlying retrieval models by designing a malicious variant that establishes robust shortcuts from triggers to toxicity surrogates. In addition, we introduce novel entropy-based selection and generative augmentation strategies for better toxicity surrogates. Extensive experiments on two mainstream tasks show that the proposed method achieves outstanding attack effects while preserving benign utility. Notably, BadRDM remains effective even under common defense strategies, further highlighting serious security concerns for RDMs.
When Efficiency Meets Safety: A Benchmark Security Analysis of KV Cache Compression in Large Language Models
Xiaoxiao Ma | Kuofeng Gao | Zeyi Lu | Wenxi Jiang | Hao Fang | Hao Wu | Bin Chen | Shu-Tao Xia
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Xiaoxiao Ma | Kuofeng Gao | Zeyi Lu | Wenxi Jiang | Hao Fang | Hao Wu | Bin Chen | Shu-Tao Xia
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Key-Value (KV) caching is widely used in large language models (LLMs) to enable long-context inference efficiently, yet its security implications remain underexplored. We present the first systematic study of how KV cache compression interacts with jailbreak attacks, evaluating four model families under diverse jailbreak attacks. We identify a double-edged effect: (i) on one hand, compression can induce Accidental Robustness, where optimization-based and encoding-based attacks fail due to Malicious Semantic Eviction, where attacks’ own attention redirection reduces the malicious query’s cache importance, and Gradient Mismatch where discrete compression operations break jailbreak optimization. (ii) On the other hand, Vulnerability Paradox arises under merging-based compression for human-designed Attacks, where aggressive merging in shallow layers triggers functional head collapse, amplifying attack success rates. To address this, we propose Safe-CAM, a history-aware, per-head feedback merging strategy that prevents safety degradation while maintaining efficiency. Experiments show Safe-CAM fully restores safety (0% ASR) and improves benign task performance with minimal overhead. Our study highlights that KV cache compression is not only an efficiency mechanism but also a safety-critical design factor in LLM deployment.
2025
QueryAttack: Jailbreaking Aligned Large Language Models Using Structured Non-natural Query Language
Qingsong Zou | Jingyu Xiao | Qing Li | Zhi Yan | Yuhang Wang | Li Xu | Wenxuan Wang | Kuofeng Gao | Ruoyu Li | Yong Jiang
Findings of the Association for Computational Linguistics: ACL 2025
Qingsong Zou | Jingyu Xiao | Qing Li | Zhi Yan | Yuhang Wang | Li Xu | Wenxuan Wang | Kuofeng Gao | Ruoyu Li | Yong Jiang
Findings of the Association for Computational Linguistics: ACL 2025
Recent advances in large language models (LLMs) have demonstrated remarkable potential in the field of natural language processing. Unfortunately, LLMs face significant security and ethical risks. Although techniques such as safety alignment are developed for defense, prior researches reveal the possibility of bypassing such defenses through well-designed jailbreak attacks. In this paper, we propose QueryAttack, a novel framework to examine the generalizability of safety alignment. By treating LLMs as knowledge databases, we translate malicious queries in natural language into structured non-natural query language to bypass the safety alignment mechanisms of LLMs. We conduct extensive experiments on mainstream LLMs, and the results show that QueryAttack not only can achieve high attack success rates (ASRs), but also can jailbreak various defense methods. Furthermore, we tailor a defense method against QueryAttack, which can reduce ASR by up to 64% on GPT-4-1106. Our code is available at https://anonymous.4open.science/r/QueryAttack-334B.
Pre-training CLIP against Data Poisoning with Optimal Transport-based Matching and Alignment
Tong Zhang | Kuofeng Gao | Jiawang Bai | Leo Yu Zhang | Xin Yin | Zonghui Wang | Shouling Ji | Wenzhi Chen
Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing
Tong Zhang | Kuofeng Gao | Jiawang Bai | Leo Yu Zhang | Xin Yin | Zonghui Wang | Shouling Ji | Wenzhi Chen
Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing
Recent studies have shown that Contrastive Language-Image Pre-training (CLIP) models are threatened by targeted data poisoning and backdoor attacks due to massive training image-caption pairs crawled from the Internet. Previous defense methods correct poisoned image-caption pairs by matching a new caption for each image. However, the matching process solely relies on the global representations of images and captions, overlooking fine-grained features of visual and textual features. It may introduce incorrect image-caption pairs and detriment the CLIP pre-training. To address their limitations, we propose an Optimal Transport-based framework to reconstruct the image-caption pairs, named OTCCLIP. We involve a new optimal transport-based distance measure between fine-grained visual and textual feature sets and re-assign new captions based on the proposed optimal transport distance. Additionally, to further reduce the negative impact of mismatched pairs, we encourage the inter- and intra-modality fine-grained alignment by employing optimal transport-based objective functions. Our experiments demonstrate that OTCCLIP can successfully decrease the attack success rates of poisoning attacks to 0% in most cases. Also, compared to previous methods, OTCCLIPsignificantly improves CLIP’s zero-shot and linear probing performance trained on poisoned datasets.
Your Language Model Can Secretly Write Like Humans: Contrastive Paraphrase Attacks on LLM-Generated Text Detectors
Hao Fang | Jiawei Kong | Tianqu Zhuang | Yixiang Qiu | Kuofeng Gao | Bin Chen | Shu-Tao Xia | Yaowei Wang | Min Zhang
Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing
Hao Fang | Jiawei Kong | Tianqu Zhuang | Yixiang Qiu | Kuofeng Gao | Bin Chen | Shu-Tao Xia | Yaowei Wang | Min Zhang
Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing
The misuse of large language models (LLMs), such as academic plagiarism, has driven the development of detectors to identify LLM-generated texts. To bypass these detectors, paraphrase attacks have emerged to purposely rewrite these texts to evade detection. Despite the success, existing methods require substantial data and computational budgets to train a specialized paraphraser, and their attack efficacy greatly reduces when faced with advanced detection algorithms. To address this, we propose Contrastive Paraphrase Attack (CoPA), a training-free method that effectively deceives text detectors using off-the-shelf LLMs. The first step is to carefully craft instructions that encourage LLMs to produce more human-like texts. Nonetheless, we observe that the inherent statistical biases of LLMs can still result in some generated texts carrying certain machine-like attributes that can be captured by detectors. To overcome this, CoPA constructs an auxiliary machine-like word distribution as a contrast to the human-like distribution generated by the LLM. By subtracting the machine-like patterns from the human-like distribution during the decoding process, CoPA is able to produce sentences that are less discernible by text detectors. Our theoretical analysis suggests the superiority of the proposed attack. Extensive experiments validate the effectiveness of CoPA in fooling text detectors across various scenarios.
VLMInferSlow: Evaluating the Efficiency Robustness of Large Vision-Language Models as a Service
Xiasi Wang | Tianliang Yao | Simin Chen | Runqi Wang | Lei Ye | Kuofeng Gao | Yi Huang | Yuan Yao
Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Xiasi Wang | Tianliang Yao | Simin Chen | Runqi Wang | Lei Ye | Kuofeng Gao | Yi Huang | Yuan Yao
Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Vision-Language Models (VLMs) have demonstrated great potential in real-world applications. While existing research primarily focuses on improving their accuracy, the efficiency remains underexplored. Given the real-time demands of many applications and the high inference overhead of VLMs, efficiency robustness is a critical issue. However, previous studies evaluate efficiency robustness under unrealistic assumptions, requiring access to the model architecture and parameters—an impractical scenario in ML-as-a-service settings, where VLMs are deployed via inference APIs. To address this gap, we propose VLMInferSlow, a novel approach for evaluating VLM efficiency robustness in a realistic black-box setting. VLMInferSlow incorporates fine-grained efficiency modeling tailored to VLM inference and leverages zero-order optimization to search for adversarial examples. Experimental results show that VLMInferSlow generates adversarial images with imperceptible perturbations, increasing the computational cost by up to 128.47%. We hope this research raises the community’s awareness about the efficiency robustness of VLMs.
Benchmarking Open-ended Audio Dialogue Understanding for Large Audio-Language Models
Kuofeng Gao | Shu-Tao Xia | Ke Xu | Philip Torr | Jindong Gu
Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Kuofeng Gao | Shu-Tao Xia | Ke Xu | Philip Torr | Jindong Gu
Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Large Audio-Language Models (LALMs), such as GPT-4o, have recently unlocked audio dialogue capabilities, enabling direct spoken exchanges with humans. The potential of LALMs broadens their applicability across a wide range of practical scenarios supported by audio dialogues. However, given these advancements, a comprehensive benchmark to evaluate the performance of LALMs in the open-ended audio dialogue understanding remains absent currently. To address this gap, we propose an Audio Dialogue Understanding Benchmark (ADU-Bench), which consists of 4 benchmark datasets. They assess the open-ended audio dialogue ability for LALMs in 3 general scenarios, 12 skills, 9 multilingual languages, and 4 categories of ambiguity handling. Notably, we firstly propose the evaluation of ambiguity handling in audio dialogues that expresses different intentions beyond the same literal meaning of sentences, e.g., ‘“Really!?”‘ with different intonations. In summary, ADU-Bench includes over 20,000 open-ended audio dialogues for the assessment of LALMs. Through extensive experiments conducted on 16 LALMs, our analysis reveals that existing LALMs struggle with mathematical symbols and formulas, understanding human behavior such as roleplay, comprehending multiple languages, and handling audio dialogue ambiguities from different phonetic elements, such as intonations, pause positions, and homophones. The benchmark is available at https://adu-bench.github.io/.
Search
Fix author
Co-authors
- Shu-Tao Xia 8
- Bin Chen 7
- Hao Fang 7
- Jiawei Kong 4
- Min Zhang 3
- Jiaxin Hong 2
- Xiaoxiao Ma 2
- Yaowei Wang 2
- Hao Wu 2
- Xiaochen Yang 2
- Hongyao Yu 2
- Jiawang Bai 1
- Yang Bai 1
- Simin Chen 1
- Wenzhi Chen 1
- Xun Chen 1
- Tao Dai 1
- Jindong Gu 1
- Yi Huang 1
- Shouling Ji 1
- Wenxi Jiang 1
- Yong Jiang 1
- Qing Li 1
- Ruoyu Li 1
- Zeyi Lu 1
- Yuxin Peng 1
- Yuzhao Peng 1
- Shuhan Qi 1
- Yixiang Qiu 1
- Xiaohang Sui 1
- Shuoyang Sun 1
- Philip Torr 1
- Bohua Wang 1
- Runqi Wang 1
- Wenxuan Wang 1
- Xiasi Wang 1
- Xuan Wang 1
- Yuhang Wang 1
- Zonghui Wang 1
- Jingyu Xiao 1
- Ke Xu 1
- Li Xu 1
- Zhi Yan 1
- Tianliang Yao 1
- Yuan Yao 1
- Lei Ye 1
- Xin Yin 1
- Sijin Yu 1
- Tao Yu 1
- Wenbo Yu 1
- Jingru Zeng 1
- Leo Yu Zhang 1
- Tianyi Zhang 1
- Tong Zhang 1
- Yechao Zhang 1
- Yihao Zhang 1
- Yv Zhang 1
- Yuxuan Zhou 1
- Tianqu Zhuang 1
- Qingsong Zou 1