用关键词扰动让检索器出错,高效攻击大模型外部知识库。
Tricking Retrievers with Influential Tokens: An Efficient Black-Box Corpus Poisoning Attack
- 利用检索器对词序不敏感和偏好关键词的特性,动态优化攻击策略。
- 生成对抗样本耗时减少80%以上,内存占用降低75%,攻击成功率保持领先。
- 适合研究模型安全、对抗攻防的工程师与安全研究人员参考。
检索增强生成(RAG)系统通过引入外部知识库提升大语言模型性能,缓解内部知识过时与幻觉问题。但其对外部知识的依赖也使其易受语料投毒攻击,即通过注入恶意段落操纵检索结果。现有方法如随机替换或训练反演模型,通常效率低下且需访问检索器梯度或大量算力。为此,本文提出动态重要性引导遗传算法(DIGA),利用检索器对词序不敏感及对关键词偏好的双重特性,动态调整遗传操作,高效生成有效对抗样本。实验表明,DIGA在多个数据集上相较现有方法显著提升效率与可扩展性,同时保持相当或更优的攻击成功率。
原文摘要 · Abstract (English)
Retrieval-augmented generation (RAG) systems enhance large language models by incorporating external knowledge, addressing issues like outdated internal knowledge and hallucination. However, their reliance on external knowledge bases makes them vulnerable to corpus poisoning attacks, where adversarial passages can be injected to manipulate retrieval results. Existing methods for crafting such passages, such as random token replacement or training inversion models, are often slow and computationally expensive, requiring either access to retriever's gradients or large computational resources. To address these limitations, we propose Dynamic Importance-Guided Genetic Algorithm (DIGA), an efficient black-box method that leverages two key properties of retrievers: insensitivity to token order and bias towards influential tokens. By focusing on these characteristics, DIGA dynamically adjusts its genetic operations to generate effective adversarial passages with significantly reduced time and memory usage. Our experimental evaluation shows that DIGA achieves superior efficiency and scalability compared to existing methods, while maintaining comparable or better attack success rates across multiple datasets.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。