Jingyu Hua
Author directory2026
KFS-RAG: Mitigating Database Leakage in RAG Systems with Keyword-Grounded Fact Substitution
ZiLiang Zhang | Yubo Zhu | Wei Tong | Jingyu Hua | Zijian Wang | Yuan Zhang | Sheng Zhong
Findings of the Association for Computational Linguistics: EMNLP 2026
ZiLiang Zhang | Yubo Zhu | Wei Tong | Jingyu Hua | Zijian Wang | Yuan Zhang | Sheng Zhong
Findings of the Association for Computational Linguistics: EMNLP 2026
Retrieval-Augmented Generation (RAG) has emerged as a powerful paradigm for combining large language models (LLMs) with external knowledge sources. However, RAG systems remain vulnerable to prompt injection attacks, which may mislead the retriever or generator to expose sensitive database contents. To address this issue, we propose KFS-RAG, a defense that mitigates information leakage by reformulating the retrieved context. Specifically, our method first identifies a small set of influential keywords from the retrieved context via an attention rollout plus a causal perturbation mechanism. These keywords are then used to guide an auxiliary LLM to generate a compact set of keyword-grounded facts from the retrieved passages. Finally, the original context is substituted with these curated facts, ensuring that the generator operates on sanitized evidence rather than the raw retrieved text. Experimental evaluations demonstrate that KFS-RAG significantly reduces the risk of database leakage under injection attacks while maintaining response accuracy and relevance. This work highlights a practical pathway toward building secure and trustworthy RAG systems.
ECHO: Replacing the Compliance Proxy with Response Harmfulness in Optimization-Based Jailbreak Attack
Yuanwei Wu | Lingdong Huang | Yunlong Mao | Kanye Ye Wang | Jingyu Hua | Sheng Zhong
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Yuanwei Wu | Lingdong Huang | Yunlong Mao | Kanye Ye Wang | Jingyu Hua | Sheng Zhong
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Despite extensive safety alignment, large language models remain vulnerable to jailbreak attacks. Existing optimization-based attacks share a single objective: maximize a token-level proxy of victim compliance—such as the likelihood of an affirmative prefix—computed on the prompt rather than the decoded reply. This proxy cannot distinguish a cautious hedge from a fully actionable harmful answer, leaving the search blind to what the model actually says. We propose ECHO (Evaluation-Conditioned Harmfulness Optimization), which replaces the compliance proxy with response-level, continuous harmfulness scores from HarmSig, a 1.7B regressor grounded in actual harmful capability. ECHO couples HarmSig with five word-level perturbation operators and Keyword-Anchored Beam Search with global top-m memory, under a strict black-box threat model. Across five open-weight victims on AdvBench, ECHO achieves up to 0.898 StrongREJECT mean score and 89.23% HarmBench success. Our code is publicly available at https://github.com/STANWYW/echo.
Secret Stealing Attacks on Local LLM Fine-Tuning through Supply-Chain Model Code Backdoors
Zi Li | Tian Zhou | Wenze Li | Jingyu Hua | Yunlong Mao | Sheng Zhong
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Zi Li | Tian Zhou | Wenze Li | Jingyu Hua | Yunlong Mao | Sheng Zhong
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Local fine-tuning datasets routinely contain sensitive secrets such as API keys, personal identifiers, and financial records. Although “local offline fine-tuning” is often viewed as a privacy boundary, we reveal that compromised model code is sufficient to steal them. Current passive pretrained-weight poisoning attacks, while effective for natural language, fundamentally fail to capture such sparse high-entropy targets due to their reliance on probabilistic semantic prefixes. To bridge this gap, we identify and exploit a practical but overlooked supply-chain vector—malicious model code camouflaged as standard architectural definitions—to realize a paradigm shift from passive weight poisoning to active execution hijacking. We introduce a deterministic full-chain memorization mechanism: it locks onto token-level secrets in dynamic computation flows via online tensor-rule matching, and leverages value–gradient decoupling to stealthily inject attack gradients, overcoming gradient drowning to force model memorization. Furthermore, we achieve, for the first time, attacker-verifiable secret stealing through black-box queries that precisely distinguishes true leakage from hallucination. Our attack achieves over 98% Strict ASR in the default LoRA setting with limited primary-task utility degradation and effectively evades defense measures including semantic safety filtering, code auditing, and perplexity-based detection.