Current stateless defences for multimodal agentic RAG fail to detect adversarial strategies that distribute malicious semantics across retrieval, planning, and generation components. We formulate this security challenge as a Partially Observable Markov Decision Process (POMDP), where adversarial intent is a latent variable inferred from noisy multi-stage observations. We introduce MMA-RAG^T, an inference-time control framework governed by a Modular Trust Agent (MTA) that maintains an approximate belief state via structured LLM reasoning. Operating as a model-agnostic overlay, MMA-RAGT mediates a configurable set of internal checkpoints to enforce stateful defence-in-depth. Extensive evaluation on 43,774 instances demonstrates a 6.50x average reduction factor in Attack Success Rate relative to undefended baselines, with negligible utility cost. Crucially, a factorial ablation validates our theoretical bounds: while statefulness and spatial coverage are individually necessary (26.4 pp and 13.6 pp gains respectively), stateless multi-point intervention can yield zero marginal benefit under homogeneous stateless filtering when checkpoint detections are perfectly correlated.
Figures & tables
Figure 1: The MMA-RAG \textscT architecture. The MTA ( Atrust ) intercepts artifacts at a set of checkpoints ( C1 - C5 in our evaluated instantiation), executes Algorithm 1 at each, and maintains a cumulative belief state Φt . Decisions δt∈{Approve,Mitigate,Refuse} gate artifact passage through the pipeline.
Configuration
CR ↑
AR ↑
ColBERTv2 + GPT-4
0.90
0.82
DPR + BART
0.62
0.58
Agentic RAG (baseline)
0.88
0.93
MMA-RAG \textscT (+ MTA )
0.87
0.93
Table 1: Utility on Natural Questions (dev, n=3,610 ). ARES scores (context relevance CR, answer relevance AR). Established baselines from Saad-Falcon et al. (2023) included for reference. Differences between the baseline and MMA-RAG \textscT are small.
Benchmark
Baseline
+ MTA
Red.
B1: Text poisoning
76.5
15.7
4.87×
B2a: Image (OCR)
22.3
2.0
11.15×
B2b: Image (MM)
10.1
5.5
1.84×
B3: Direct query
59.0
4.1
14.39×
B4: Tool-flip
82.1
63.5
1.29×
B5: Agentic integrity
48.5
8.9
5.45×
Table 2: ASR (%, ↓ ) across ART-SafeBench benchmarks with GPT-4o backbone. Reduction factor = baseline ASR / defended ASR. Avg. (factor) is the unweighted mean of per-benchmark reduction factors.
Figure 2: Experimental results overview. (a) ASR across all ART-SafeBench benchmarks: the MTA reduces ASR on every surface, with reduction factors ranging from 1.3× (B4, tool-flip) to 14.4× (B3, direct query); mean factor 6.50× . (b) Factorial ablation on B1: statefulness contributes −26.4 pp and multi-stage coverage −13.6 pp; the two mechanisms are individually necessary and their combination yields super-additive gains, validating Propositions 1 and 2 . (c) Cross-LLM generalisation on B1: defence transfers across four backbones ( 2.5× - 9.5× reduction), with invariant relative difficulty ordering.
Configuration
ASR ↓
Δ pp
Refusals
No MTA (baseline)
76.5
+19.8
-
Stateless, final-only
56.7 †
0.0 †
-
Stateful, final-only
43.9
−12.8
18
Stateless, multi-stage
56.7
ref.
45
Stateful, multi-stage
30.3
−26.4
42
Table 3: Ablation on B1 (%). Stateful : belief state maintained across checkpoints. Multi-stage : all C1-C5. Δ pp: change vs. stateless, multi-stage (ref.). Refusals: total MTA block actions per evaluation run. † Implied by Proposition 2 (i); not independently measured. Stateless configurations structurally model existing boundary-filter paradigms.
Appendix figures & tables2 assets
Supplementary material from the paper’s appendix.
Appendix
LLM Backbone
Base
+ MTA
Red.
GPT-4o
76.5
15.7
4.9×
GPT-4o-mini
78.4
31.5
2.5×
Llama-3.3-70B
70.9
7.5
9.5×
GPT-4.1
78.0
14.0
5.6×
Appendix
Table 4: Per-LLM end-to-end ASR (%) and reduction factors for B1 (Text Poisoning), varying the protected backbone while keeping the trust layer fixed.
OWASP Category
n
Base
+ MTA
Prompt injection (LLM01)
1,477
64
8
Insecure output (LLM05)
716
71
< 1
Sensitive info. (LLM02)
715
36
0
Supply chain (LLM03)
623
58
0
Misinfo./harmful (LLM09)
738
63
5
Model DoS (LLM10)
709
61
7
Appendix
Table 5: Per-OWASP ASR (%) for B3 for the six instantiated categories ( n=4,978 of 10,005). Information disclosure (LLM02) and supply-chain (LLM03) attacks are eliminated entirely.
Retrieval-augmented generation (RAG) systems are increasingly deployed in sensitive domains such as healthcare and law, where they rely on private, domain-specific knowledge. This capability introduces significant security risks, including membership inference, data poisoning, and unintended content leakage. A straightforward mitigation is to enable all relevant defenses simultaneously, but doing so incurs a substantial utility cost. In our experiments, an always-on defense stack reduces contextual recall by more than 40%, indicating that retrieval degradation is the primary failure mode. To mitigate this trade-off in RAG systems, we propose the Sentinel-Strategist architecture, a context-aware framework for risk analysis and defense selection. A Sentinel detects anomalous retrieval behavior, after which a Strategist selectively deploys only the defenses warranted by the query context. Evaluated across three benchmark datasets and five orchestration models, ADO is shown to eliminate MBA-style membership inference leakage while substantially recovering retrieval utility relative to a fully static defense stack, approaching undefended baseline levels. Under data poisoning, the strongest ADO variants reduce attack success to near zero while restoring contextual recall to more than 75% of the undefended baseline, although robustness remains sensitive to model choice. Overall, these findings show that adaptive, query-aware defense can substantially reduce the security-utility trade-off in RAG systems.
Pranav Pallerla, Wilson Naik Bhukya, Bharath Vemula +1
School of Computer and Information Sciences University of Hyderabad Hyderabad, Telangana, India · Purdue University West Lafayette, USA
Multimodal agentic retrieval-augmented generation (RAG) systems expand the attack surface beyond prompt injection to include text poisoning, image injection, direct-query attacks, and orchestrator-level tool manipulation. Existing red-teaming approaches are typically surface-specific and often recycle known attack templates; on text-poisoning benchmarks we measure 73-84% exact duplication. We present MIRROR, a unified cross-surface framework that performs memory-guided Monte Carlo tree search while conditioning candidate generation on retrieved context under an explicit novelty constraint. A deterministic Novelty Gate rejects any candidate matching the retrieval set under normalized comparison, allowing retrieval to inform search priors without enabling prompt copying. Across four attack surfaces on a multimodal agentic RAG target, MIRROR attains 76% ASR on image poisoning compared with 52% for baselines, 97% ASR on orchestrator attacks at half the query cost, and the lowest cross-surface variance (coefficient of variation 0.47). In contrast, specialized baselines collapse across surfaces: suffix optimization reaches 79% ASR on text poisoning but 1% on direct queries. We release ART-SafeBench with 41,815 in-package records and runtime adapters yielding 41,991+ total records across four surfaces.
Retrieval-augmented generation (RAG) improves the factuality of large language models by grounding responses in external documents, but it also exposes a critical security vulnerability: adversarial documents injected into the knowledge database can enter the context window and steer the model toward targeted incorrect answers. Existing post-retrieval defenses rely on instruction following, parametric knowledge, or text-level consistency, all of which can be imitated or optimized against by adaptive attackers. We propose RAGSentinel, a training-free, label-free defense for black-box RAG systems. RAGSentinel uses a surrogate encoder to measure query-conditioned hidden-state shifts induced by retrieved documents, removes shared topic directions, and filters poisoned documents as geometric outliers from a robust majority consensus. We prove that, under an honest-majority assumption and a representation-level separation condition, RAGSentinel exactly recovers a poison-free majority-sized context. Experiments across three question-answering datasets, three LLM families, and multiple poisoning attacks show that RAGSentinel consistently achieves low attack success rates while preserving competitive accuracy and remaining effective against adaptive attacks with full pipeline knowledge.
Yueyang Quan, Anjun Gao, Yufei Xia +2
University of North Texas · University of Louisville