提出新方法检测联网大模型搜索环节的安全漏洞
When Search Goes Wrong: Red-Teaming Web-Augmented Large Language Models
- 设计三类伪装成正常查询的攻击策略,诱导模型引用有害内容
- 在黑盒环境下通过迭代优化提升攻击成功率,绕过安全过滤
- 构建专用数据集训练模型,专门用于发现搜索流程中的风险
大语言模型通过接入网络搜索以突破静态知识边界,获取实时信息。然而这一机制引入了新的安全威胁:检索与引用过程可能使用户暴露于有害或低可信度网页内容。现有红队测试方法主要针对独立大模型的生成不安全内容,忽略了搜索流程带来的风险。为此,我们提出 CREST-Search——首个面向联网大模型的红队框架。其核心是三种新颖攻击策略,可生成看似无害的搜索查询,却诱导模型引用不安全内容;同时采用上下文迭代优化机制,在黑盒约束下增强攻击效果。此外,我们构建了专门的有害数据集 WebSearch-Harm,用于微调专用红队模型,提升查询质量。实验表明,CREST-Search能有效绕过安全过滤,系统性暴露基于搜索的大模型系统漏洞,凸显开发鲁棒搜索模型的紧迫性。
原文摘要 · Abstract (English)
Large Language Models (LLMs) have been augmented with web search to overcome the limitations of the static knowledge boundary by accessing up-to-date information from the open Internet. While this integration enhances model capability, it also introduces a distinct safety threat surface: the retrieval and citation process has the potential risk of exposing users to harmful or low-credibility web content. Existing red-teaming methods are largely designed for standalone LLMs as they primarily focus on unsafe generation, ignoring risks emerging from the complex search workflow. To address this gap, we propose CREST-Search, a pioneering red-teaming framework for LLMs with web search. The cornerstone of CREST-Search is three novel attack strategies that generate seemingly benign search queries yet induce unsafe citations. It also employs an iterative in-context refinement mechanism to strengthen adversarial effectiveness under black-box constraints. In addition, we construct a search-specific harmful dataset, WebSearch-Harm, which enables fine-tuning a specialized red-teaming model to improve query quality. Our experiments demonstrate that CREST-Search can effectively bypass safety filters and systematically expose vulnerabilities in web search-based LLM systems, underscoring the necessity of the development of robust search models.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。