混合检索中向量种子可借实体链接泄露敏感数据,需在图扩展处重新授权。
Retrieval Pivot Attacks in Hybrid RAG: Measuring and Mitigating Amplified Leakage from Vector Seeds to Graph Expansion
- 在向量与知识图谱结合处设置授权检查,防止跨租户数据泄露。
- 实测最大泄露风险达0.95,多数泄漏发生在第2跳(PD=2)。
- 无需恶意注入,自然共享实体即可形成泄露路径,适合安全研究者参考。
混合检索增强生成(Hybrid RAG)结合向量相似性搜索与知识图谱扩展,实现多跳推理。我们发现这种组合引入了新型安全漏洞:向量检索的‘种子’片段可通过实体链接渗透至敏感图谱区域,导致跨租户数据泄露,而纯向量检索不会发生此类问题。我们将其定义为检索枢轴风险(RPR),并提出泄漏@k、放大因子和枢轴深度(PD)三个指标量化泄露程度与遍历结构。本文提出七种检索枢轴攻击,均利用向量到图谱的边界漏洞,且无需恶意注入——自然共享实体即可自发形成跨租户路径。在合成多租户企业语料与Enron邮件语料上,未受保护的混合管道显示极高风险(最高RPR=0.95),每查询返回多个未经授权项。泄漏集中出现在PD=2,归因于块-实体双分图拓扑,我们据此提出一个形式化命题。进一步证明,仅在图谱扩展边界强制授权即可彻底消除泄漏(RPR接近0),覆盖所有攻击变体及最高10%的标签伪造率,开销极小。结果表明根本原因在于边界未重检授权,而非防御复杂度:两个独立安全组件组合后仍可能不安全,除非在转换点重新验证权限。
原文摘要 · Abstract (English)
Hybrid Retrieval-Augmented Generation (RAG) pipelines combine vector similarity search with knowledge graph expansion for multi-hop reasoning. We show that this composition introduces a distinct security failure mode: a vector-retrieved "seed" chunk can pivot via entity links into sensitive graph neighborhoods, causing cross-tenant data leakage that does not occur in vector-only retrieval. We formalize this risk as Retrieval Pivot Risk (RPR) and introduce companion metrics Leakage@k, Amplification Factor, and Pivot Depth (PD) to quantify leakage magnitude and traversal structure. We present seven Retrieval Pivot Attacks that exploit the vector-to-graph boundary and show that adversarial injection is not required: naturally shared entities create cross-tenant pivot paths organically. Across a synthetic multi-tenant enterprise corpus and the Enron email corpus, the undefended hybrid pipeline exhibits high pivot risk (RPR up to 0.95) with multiple unauthorized items returned per query. Leakage consistently appears at PD=2, which we attribute to the bipartite chunk-entity topology and formalize as a proposition. We then show that enforcing authorization at a single location, the graph expansion boundary, eliminates measured leakage (RPR near 0) across both corpora, all attack variants, and label forgery rates up to 10 percent, with minimal overhead. Our results indicate the root cause is boundary enforcement, not inherently complex defenses: two individually secure retrieval components can compose into an insecure system unless authorization is re-checked at the transition point.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。