EDBT 2026 Demo / reviewers in the wild / expert
Kuofeng Gao
dblp:302/4618
· DBLP profile ↗
18ranked-venue papers
6as first author
18since 2021 · last 2026
0000-0002-5667-8238ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 15 · 4 first-author · 15 since 2021Graphics, computer vision, multimedia, augmented reality and games · 6 · 2 first-author · 6 since 2021Security and privacy · 3 · 2 first-author · 3 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Retrievals Can Be Detrimental: Unveiling the Backdoor Vulnerability of Retrieval-Augmented Diffusion ModelsabstractHao 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). 2026. Hao Fang 0011, Xiaohang Sui, Hongyao Yu, Kuofeng Gao, Jiawei Kong 0001, Sijin Yu, Bin Chen 0011, Shutao Xia |
ACL (1) | 4 |
| 2026 | When Efficiency Meets Safety: A Benchmark Security Analysis of KV Cache Compression in Large Language ModelsabstractXiaoxiao 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). 2026. Kuofeng Gao, Zeyi Lu, Wenxi Jiang, Hao Fang 0011, Bin Chen 0011, Shutao Xia |
ACL (1) | 2 |
| 2026 | Toward Dataset Copyright Evasion Attack Against Personalized Text-to-Image Diffusion ModelsabstractText-to-image (T2I) diffusion models enable high-quality image generation conditioned on textual prompts. However, fine-tuning these pre-trained models for personalization raises concerns about unauthorized dataset usage. To address this issue, dataset ownership verification (DOV) has recently been proposed, which embeds watermarks into fine-tuning datasets via backdoor techniques. These watermarks remain dormant on benign samples but produce owner-specified outputs when triggered. Despite its promise, the robustness of DOV against copyright evasion attacks (CEA) remains unexplored. In this paper, we investigate how adversaries can circumvent these mechanisms, enabling models trained on watermarked datasets to bypass ownership verification. We begin by analyzing the limitations of potential attacks achieved by backdoor removal, including TPD and T2IShield. In practice, TPD suffers from inconsistent effectiveness due to randomness, while T2IShield fails when watermarks are embedded as local image patches. To this end, we introduce CEAT2I, the first CEA specifically targeting DOV in T2I diffusion models. CEAT2I consists of three stages: (1) motivated by the observation that T2I models converge faster on watermarked samples with respect to intermediate features rather than training loss, we reliably detect watermarked samples; (2) we iteratively ablate tokens from the prompts of detected samples and monitor feature shifts to identify trigger tokens; and (3) we apply a closed-form concept erasure method to remove the injected watermarks. Extensive experiments demonstrate that CEAT2I effectively evades state-of-the-art DOV mechanisms while preserving model performance. The code is available at https://github.com/csyufei/CEAT2I. Kuofeng Gao, Yiming Li 0004, Jiawang Bai, Yong Yang 0001, Zhifeng Li 0001, Shutao Xia |
IEEE Trans. Inf. Forensics Secur. | 1 |
| 2025 | Benchmarking Open-ended Audio Dialogue Understanding for Large Audio-Language ModelsabstractLarge 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 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/. Kuofeng Gao, Shutao Xia, Ke Xu 0002, Philip Torr 0001, Jindong Gu |
ACL (1) | 1 |
| 2025 | VLMInferSlow: Evaluating the Efficiency Robustness of Large Vision-Language Models as a ServiceabstractVision-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. Xiasi Wang, Tianliang Yao, Runqi Wang, Kuofeng Gao, Yi Huang 0035 |
ACL (1) | 6 |
| 2025 | Protecting Your Video Content: Disrupting Automated Video-based LLM AnnotationsabstractRecently, video-based large language models (video-based LLMs) have achieved impressive performance across various video comprehension tasks. However, this rapid advancement raises significant privacy and security concerns, particularly regarding the unauthorized use of personal video data in automated annotation by video-based LLMs. These unauthorized annotated video-text pairs can then be used to improve the performance of downstream tasks, such as text-to-video generation. To safeguard personal videos from unauthorized use, we propose two series of protective video watermarks with imperceptible adversarial perturbations, named Ramblings and Mutes. Concretely, Ramblings aim to mislead video-based LLMs into generating inaccurate captions for the videos, thereby degrading the quality of video annotations through inconsistencies between video content and captions. Mutes, on the other hand, are designed to prompt video-based LLMs to produce exceptionally brief captions, lacking descriptive detail. Extensive experiments demonstrate that our video watermarking methods effectively protect video data by significantly reducing video annotation performance across various video-based LLMs, showcasing both stealthiness and robustness in protecting personal video content. Our code is available at https://github.com/ttthhl/Protecting_Your_Video_Content. Haitong Liu, Kuofeng Gao, Yang Bai 0011, Jinmin Li, Jinxiao Shan, Tao Dai 0001, Shutao Xia |
CVPR | 2 |
| 2025 | Your Language Model Can Secretly Write Like Humans: Contrastive Paraphrase Attacks on LLM-Generated Text DetectorsabstractHao 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. 2025. Hao Fang 0011, Jiawei Kong 0001, Tianqu Zhuang, Yixiang Qiu, Kuofeng Gao, Bin Chen 0011, Shutao Xia, Yaowei Wang 0001, Min Zhang 0005 |
EMNLP | 5 |
| 2025 | Pre-training CLIP against Data Poisoning with Optimal Transport-based Matching and AlignmentabstractRecent studies have shown that Contrastive Language-Image Pre-training (CLIP) models are threatened by targeted data poisoning and backdoor attacks due to massive training imagecaption pairs crawled from the Internet.Previous defense methods correct poisoned imagecaption pairs by matching a new caption for each image.However, the matching process relies solely 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 harm the CLIP pre-training.To address their limitations, we propose an Optimal Transportbased framework to reconstruct image-caption pairs, named OTCCLIP.We propose 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 OTC-CLIP can successfully decrease the attack success rates of poisoning attacks.Also, compared to previous methods, OTCCLIP significantly improves CLIP's zero-shot and linear probing performance trained on poisoned datasets. Kuofeng Gao, Jiawang Bai, Leo Yu Zhang, Zonghui Wang, Shouling Ji, Wenzhi Chen |
EMNLP | 2 |
| 2025 | Grounding Language with Vision: A Conditional Mutual Information Calibrated Decoding Strategy for Reducing Hallucinations in LVLMsabstractLarge Vision-Language Models (LVLMs) are susceptible to hallucinations, where generated responses seem semantically plausible yet exhibit little or no relevance to the input image. Previous studies reveal that this issue primarily stems from LVLMs' over-reliance on language priors while disregarding the visual information during decoding. To alleviate this issue, we introduce a novel Conditional Pointwise Mutual Information (C-PMI) calibrated decoding strategy, which adaptively strengthens the mutual dependency between generated texts and input images to mitigate hallucinations. Unlike existing methods solely focusing on text token sampling, we propose to jointly model the contributions of visual and textual tokens to C-PMI, formulating hallucination mitigation as a bi-level optimization problem aimed at maximizing mutual information. To solve it, we design a token purification mechanism that dynamically regulates the decoding process by sampling text tokens remaining maximally relevant to the given image, while simultaneously refining image tokens most pertinent to the generated response. Extensive experiments across various benchmarks reveal that the proposed method significantly reduces hallucinations in LVLMs while preserving decoding efficiency. Hao Fang 0011, Changle Zhou, Jiawei Kong 0001, Kuofeng Gao, Bin Chen 0011, Guojun Ma, Shutao Xia |
NeurIPS | 4 |
| 2025 | PointNCBW: Toward Dataset Ownership Verification for Point Clouds via Negative Clean-Label Backdoor WatermarkabstractRecently, point clouds have been widely used in computer vision, whereas their collection is time-consuming and expensive. As such, point cloud datasets are the valuable intellectual property of their owners and deserve protection. To detect and prevent unauthorized use of these datasets, especially for commercial or open-sourced ones that cannot be sold again or used commercially without permission, we intend to identify whether a suspicious third-party model is trained on our protected dataset under the black-box setting. We achieve this goal by designing ascalableclean-label backdoor-based dataset watermark for point clouds that ensures both effectiveness and stealthiness. Unlike existing clean-label watermark schemes, which were susceptible to the number of categories, our method can watermark samples from all classes instead of only from the target one. Accordingly, it can still preserve high effectiveness even on large-scale datasets with many classes. Specifically, we perturb selected point clouds with non-target categories in both shape-wise and point-wise manners before inserting trigger patterns without changing their labels. The features of perturbed samples are similar to those of benign samples from the target class. As such, models trained on the watermarked dataset will have a distinctive yet stealthy backdoor behavior,$i.e$., misclassifying samples from the target class whenever triggers appear, since the trained DNNs will treat the inserted trigger pattern as a signal to deny predicting the target label. We also design a hypothesis-test-guided dataset ownership verification based on the proposed watermark. Extensive experiments on benchmark datasets are conducted, verifying the effectiveness of our method and its resistance to potential removal methods. The codes are available athttps://github.com/weic0810/PointNCBW. Kuofeng Gao, Shuo Shao 0002, Yiming Li 0004, Zhibo Wang 0001, Zhan Qin |
IEEE Trans. Inf. Forensics Secur. | 3 |
| 2024 | BadCLIP: Trigger-Aware Prompt Learning for Backdoor Attacks on CLIPabstractContrastive Vision-Language Pre-training, known as CLIP, has shown promising effectiveness in addressing downstream image recognition tasks. However, recent works revealed that the CLIP model can be implanted with a downstream-oriented backdoor. On downstream tasks, one victim model performs well on clean samples but predicts a specific target class whenever a specific trigger is present. For injecting a backdoor, existing attacks depend on a large amount of additional data to maliciously fine-tune the entire pre-trained CLIP model, which makes them inapplicable to data-limited scenarios. In this work, motivated by the recent success of learnable prompts, we address this problem by injecting a backdoor into the CLIP model in the prompt learning stage. Our method named BadCLIP is built on a novel and effective mechanism in backdoor attacks on CLIP, i.e., influencing both the image and text encoders with the trigger. It consists of a learnable trigger applied to images and a trigger-aware context generator, such that the trigger can change text features via trigger-aware prompts, resulting in a powerful and generalizable attack. Extensive experiments conducted on 11 datasets verify that the clean accuracy of BadCLIP is similar to those of advanced prompt learning methods and the attack success rate is higher than 99% in most cases. BadCLIP is also generalizable to unseen classes, and shows a strong generalization capability under cross-dataset and cross-domain settings. The code is available at https://github.com/jiawangbai/BadCLIP. Jiawang Bai, Kuofeng Gao, Shaobo Min, Shutao Xia, Zhifeng Li 0001, Wei Liu 0005 |
CVPR | 2 |
| 2024 | Not All Prompts Are Secure: A Switchable Backdoor Attack Against Pre-trained Vision TransfomersabstractGiven the power of vision transformers, a new learning paradigm, pre-training and then prompting, makes it more efficient and effective to address downstream visual recog-nition tasks. In this paper, we identify a novel security threat towards such a paradigm from the perspective of back-door attacks. Specifically, an extra prompt token, called the switch token in this work, can turn the backdoor mode on, i.e., converting a benign model into a backdoored one. Once under the backdoor mode, a specific trigger can force the model to predict a target class. It poses a severe risk to the users of cloud API, since the malicious behavior can not be activated and detected under the benign mode, thus making the attack very stealthy. To attack a pre-trained model, our proposed attack, named SWARM, learns a trigger and prompt tokens including a switch token. They are optimized with the clean loss which encourages the model always be-haves normally even the trigger presents, and the backdoor loss that ensures the backdoor can be activated by the trig-ger when the switch is on. Besides, we utilize the cross-mode feature distillation to reduce the effect of the switch token on clean samples. The experiments on diverse vi-sual recognition tasks confirm the success of our switchable backdoor attack, i.e., achieving 95%+ attack success rate, and also being hard to be detected and removed. Our code is available at https://github.com/20000yshust/SWARM. Jiawang Bai, Kuofeng Gao, Yong Yang 0001, Yiming Li 0004, Shutao Xia |
CVPR | 3 |
| 2024 | Inducing High Energy-Latency of Large Vision-Language Models with Verbose ImagesabstractLarge vision-language models (VLMs) such as GPT-4 have achieved exceptional performance across various multi-modal tasks. However, the deployment of VLMs necessitates substantial energy consumption and computational resources. Once attackers maliciously induce high energy consumption and latency time (energy-latency cost) during inference of VLMs, it will exhaust computational resources. In this paper, we explore this attack surface about availability of VLMs and aim to induce high energy-latency cost during inference of VLMs. We find that high energy-latency cost during inference of VLMs can be manipulated by maximizing the length of generated sequences. To this end, we propose verbose images, with the goal of crafting an imperceptible perturbation to induce VLMs to generate long sentences during inference. Concretely, we design three loss objectives. First, a loss is proposed to delay the occurrence of end-of-sequence (EOS) token, where EOS token is a signal for VLMs to stop generating further tokens. Moreover, an uncertainty loss and a token diversity loss are proposed to increase the uncertainty over each generated token and the diversity among all tokens of the whole generated sequence, respectively, which can break output dependency at token-level and sequence-level. Furthermore, a temporal weight adjustment algorithm is proposed, which can effectively balance these losses. Extensive experiments demonstrate that our verbose images can increase the length of generated sequences by 7.87× and 8.56× compared to original images on MS-COCO and ImageNet datasets, which presents potential challenges for various applications. Kuofeng Gao, Yang Bai 0011, Jindong Gu, Shutao Xia, Philip Torr 0001, Zhifeng Li 0001, Wei Liu 0005 |
ICLR | 1 |
| 2024 | Imperceptible and Robust Backdoor Attack in 3D Point CloudabstractWith the thriving of deep learning in processing point cloud data, recent works show that backdoor attacks pose a severe security threat to 3D vision applications. The attacker injects the backdoor into the 3D model by poisoning a few training samples with trigger, such that the backdoored model performs well on clean samples but behaves maliciously when the trigger pattern appears. Existing attacks often insert some additional points into the point cloud as the trigger, or utilize a linear transformation (e.g., rotation) to construct the poisoned point cloud. However, the effects of these poisoned samples are likely to be weakened or even eliminated by some commonly used pre-processing techniques for 3D point cloud, e.g., outlier removal or rotation augmentation. In this paper, we propose a novel imperceptible and robust backdoor attack (IRBA) to tackle this challenge. We utilize a nonlinear and local transformation, called weighted local transformation (WLT), to construct poisoned samples with unique transformations. As there are several hyper-parameters and randomness in WLT, it is difficult to produce two similar transformations. Consequently, poisoned samples with unique transformations are likely to be resistant to aforementioned pre-processing techniques. Besides, the distortion caused by a fixed WLT is both controllable and smooth, resulting in the generated poisoned samples that are imperceptible to human inspection. Extensive experiments on three benchmark datasets and four models show that IRBA achieves$80\%+$attack success rate (ASR) in most cases even with pre-processing techniques, which is significantly higher than previous state-of-the-art attacks. Our code is available athttps://github.com/KuofengGao/IRBA. Kuofeng Gao, Jiawang Bai, Baoyuan Wu, Mengxi Ya, Shutao Xia |
IEEE Trans. Inf. Forensics Secur. | 1 |
| 2023 | Backdoor Attack on Hash-based Image Retrieval via Clean-label Data Poisoning
Kuofeng Gao, Jiawang Bai, Bin Chen 0011, Dongxian Wu, Shutao Xia |
BMVC | 1 |
| 2023 | Backdoor Defense via Adaptively Splitting Poisoned DatasetabstractBackdoor defenses have been studied to alleviate the threat of deep neural networks (DNNs) being backdoor attacked and thus maliciously altered. Since DNNs usually adopt some external training data from an untrusted third party, a robust backdoor defense strategy during the training stage is of importance. We argue that the core of training-time defense is to select poisoned samples and to handle them properly. In this work, we summarize the training-time defenses from a unified framework as splitting the poisoned dataset into two data pools. Under our framework, we propose an adaptively splitting dataset-based defense (ASD). Concretely, we apply loss-guided split and meta-learning-inspired split to dynamically update two data pools. With the split clean data pool and polluted data pool, ASD successfully defends against backdoor attacks during training. Extensive experiments on multiple benchmark datasets and DNN models against six state-of-the-art backdoor attacks demonstrate the superiority of our ASD. Our code is available at https://github.com/KuofengGao/ASD. Kuofeng Gao, Yang Bai 0011, Jindong Gu, Yong Yang 0001, Shutao Xia |
CVPR | 1 |
| 2022 | Hardly Perceptible Trojan Attack Against Neural Networks with Bit Flips
Jiawang Bai, Kuofeng Gao, Dihong Gong, Shutao Xia, Zhifeng Li 0001, Wei Liu 0005 |
ECCV (5) | 2 |
| 2022 | Practical protection against video data leakage via universal adversarial head
Jiawang Bai, Bin Chen 0011, Kuofeng Gao, Xuan Wang 0002, Shutao Xia |
Pattern Recognit. | 3 |