Pith. sign in

REVIEW 4 cited by

Data Extraction Attacks in Retrieval-Augmented Generation via Backdoors

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2411.01705 v2 pith:YIT2SJPV submitted 2024-11-03 cs.CR cs.CL

Data Extraction Attacks in Retrieval-Augmented Generation via Backdoors

classification cs.CR cs.CL
keywords extractiondataattacksknowledgemodelspoisonedwhenachieve
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Despite significant advancements, large language models (LLMs) still struggle with providing accurate answers when lacking domain-specific or up-to-date knowledge. Retrieval-Augmented Generation (RAG) addresses this limitation by incorporating external knowledge bases, but it also introduces new attack surfaces. In this paper, we investigate data extraction attacks targeting RAG's knowledge databases. We show that previous prompt injection-based extraction attacks largely rely on the instruction-following capabilities of LLMs. As a result, they fail on models that are less responsive to such malicious prompts -- for example, our experiments show that state-of-the-art attacks achieve near-zero success on Gemma-2B-IT. Moreover, even for models that can follow these instructions, we found fine-tuning may significantly reduce attack performance. To further reveal the vulnerability, we propose to backdoor RAG, where a small portion of poisoned data is injected during the fine-tuning phase to create a backdoor within the LLM. When this compromised LLM is integrated into a RAG system, attackers can exploit specific triggers in prompts to manipulate the LLM to leak documents from the retrieval database. By carefully designing the poisoned data, we achieve both verbatim and paraphrased document extraction. For example, on Gemma-2B-IT, we show that with only 5\% poisoned data, our method achieves an average success rate of 94.1\% for verbatim extraction (ROUGE-L score: 82.1) and 63.6\% for paraphrased extraction (average ROUGE score: 66.4) across four datasets. These results underscore the privacy risks associated with the supply chain when deploying RAG systems.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. SoK: Colluding Adversaries in Machine Learning Pipelines

    cs.CR 2026-06 unverdicted novelty 7.0

    The paper introduces a framework for collusion between train- and inference-time adversaries in ML pipelines, proposes a guideline for conjecturing collusion potential, explains prior work, and empirically validates f...

  2. Not All Entities are Created Equal: A Dynamic Anonymization Framework for Privacy-Preserving RAG

    cs.CR 2026-03 unverdicted novelty 7.0

    TRIP-RAG dynamically anonymizes only high-risk entities in RAG knowledge bases via three context-aware metrics, achieving privacy comparable to full anonymization with under 35% recall drop and up to 56% better genera...

  3. Not All Entities are Created Equal: A Dynamic Anonymization Framework for Privacy-Preserving RAG

    cs.CR 2026-03 conditional novelty 6.0

    Context-aware selective entity anonymization for RAG matches full-anonymization privacy with <35% Recall@k drop and up to 56% better generation quality than baselines.

  4. Differentially Private Synthetic Text Generation for Retrieval-Augmented Generation (RAG)

    cs.CR 2025-10 unverdicted novelty 6.0

    DP-SynRAG generates reusable differentially private synthetic RAG databases via LLM private prediction to prevent privacy loss accumulation from repeated noise.