REVIEW 10 cited by
Machine Against the RAG: Jamming Retrieval-Augmented Generation with Blocker Documents
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
Signed reviews
read the original abstract
Retrieval-augmented generation (RAG) systems respond to queries by retrieving relevant documents from a knowledge database and applying an LLM to the retrieved documents. We demonstrate that RAG systems that operate on databases with untrusted content are vulnerable to denial-of-service attacks we call jamming. An adversary can add a single ``blocker'' document to the database that will be retrieved in response to a specific query and result in the RAG system not answering this query, ostensibly because it lacks relevant information or because the answer is unsafe. We describe and measure the efficacy of several methods for generating blocker documents, including a new method based on black-box optimization. Our method (1) does not rely on instruction injection, (2) does not require the adversary to know the embedding or LLM used by the target RAG system, and (3) does not employ an auxiliary LLM. We evaluate jamming attacks on several embeddings and LLMs and demonstrate that the existing safety metrics for LLMs do not capture their vulnerability to jamming. We then discuss defenses against blocker documents.
Forward citations
Cited by 10 Pith papers
-
RAG LLMs are Not Safer: A Safety Analysis of Retrieval-Augmented Generation for Large Language Models
RAG can make language models less safe than their non-RAG equivalents, even with safe documents, and current jailbreak methods transfer poorly to RAG.
-
ImportSnare: Directed "Code Manual" Hijacking in Retrieval-Augmented Code Generation
Documentation poisoning with hidden ranking and suggestion sequences can make RAG-based code generators confidently recommend malicious dependencies, even at 0.01% poisoning ratios.
-
EcoSafeRAG: Efficient Security through Context Analysis in Retrieval-Augmented Generation
EcoSafeRAG filters poisoned or injected documents from RAG inputs by sentence-level splitting plus bait-guided DBSCAN clustering of context vectors, before the language model generates an answer.
-
Rerouting LLM Routers
Adversarially optimized, query-independent token prefixes can reroute nearly all queries to the expensive strong model in both open-source and commercial LLM routers.
-
TrustRAG: Enhancing Robustness and Trustworthiness in Retrieval-Augmented Generation
TrustRAG combines K-means filtering with LLM self-assessment to defend RAG systems against corpus poisoning attacks, cutting attack success rates while preserving accuracy.
-
Layer-Wise Perturbations via Sparse Autoencoders for Adversarial Text Generation
Sparse autoencoder activation perturbation (SFPF) applied on top of existing jailbreak prompts raises attack success rate on Qwen3-32B, but with no defense evaluation and weak reproducibility.
-
Benchmarking Poisoning Attacks against Retrieval-Augmented Generation
A unified benchmark evaluation finds that existing RAG poisoning attacks remain effective on standard QA datasets, drop on expanded knowledge bases, and are only partially mitigated by current defenses.
-
Hoist with His Own Petard: Inducing Guardrails to Facilitate Denial-of-Service Attacks on Retrieval-Augmented Generation of LLMs
MutedRAG injects jailbreak-style sentences into a RAG knowledge base, causing the language model's safety guardrails to block benign queries.
-
Retrieval Augmented Generation Evaluation in the Era of Large Language Models: A Comprehensive Survey
A review that organizes RAG evaluation into internal and external categories, catalogs dozens of benchmarks, and analyzes evaluation practices in 582 conference papers.
-
Provably Secure Retrieval-Augmented Generation
SAG encrypts RAG knowledge bases and claims formal security, but its proofs are flawed and its benchmarks guarantee zero attack success by design.
Discussion (0). Continue with ORCID to comment.