Skip to main content
LLM Security Database
Skip to research search
Last analyzed Sep 9, 2026

Language Model Security Database

985 research findings · 1119 evaluated models

Filtered research findings

22 entries

Matches every word across titles, descriptions, sources, affected systems, and models.

Single-interaction poisoning of agent memory

Published Analyzed Source: arXiv

A stored interaction can later steer a memory-augmented agent's answer without direct memory-store access. The study evaluates persistent response manipulation in MemoryOS and MemGPT.

InjecMEM: Memory Injection Attack on LLM Agent Memory Systems
Evaluated models: Qwen 2.5 7B Instruct, Qwen 2.5 1.5B Instruct, Qwen 2.5 3B Instruct+3 more
  • Qwen 2.5 7B Instruct
  • Qwen 2.5 1.5B Instruct
  • Qwen 2.5 3B Instruct
  • Qwen 2.5 14B Instruct
  • Llama 3.1 8B Instruct
  • Mistral 7B Instruct v0.3

Backdoored PEFT adapters and limits of weight-only detection

Published Analyzed Source: arXiv

Third-party fine-tuning adapters may contain backdoors. Z-PEFT screens adapter weights using spectral features, evaluated on PADBench's 13,300 adapters.

Z-PEFT: Zero-shot Backdoor Detection in Parameter-Efficient Fine-Tuning via Canonical Spectral Signatures
Evaluated models: Llama 2 7B, Llama 2 13B, Qwen 1.5 7B+2 more
  • Llama 2 7B
  • Llama 2 13B
  • Qwen 1.5 7B
  • Flan-T5 XL
  • RoBERTa Base

Query-Agnostic Poisoning of Policy-Aware RAG Knowledge Bases

Published Analyzed Source: arXiv

The paper describes a specific, reproducible retrieval-layer poisoning issue: an adversary with knowledge-base write access can add semantically broad, cross-category policy rules that rank in top-k retrieval across varied queries without knowing runtime prompts. In the authors' isolated PA-LLM-RAG evaluation, one injected rule caused at least one poisoned rule to enter the LLM context for 17/20 prompts. Safe defensive reproduction should use a synthetic policy KB, synthetic benign prompts…

Knowledge Base Poisoning Attacks and Defense for Policy-Aware LLM-RAG Framework
Evaluated models: nomic-embed-text

Fluent Single-Document RAG Corpus Poisoning

Published Analyzed Source: arXiv

SilentRetrieval describes a specific RAG corpus-integrity vulnerability: an attacker able to add a topically relevant document to a retrieval corpus can make that document rank highly and influence the generated answer while remaining fluent enough to evade simple perplexity checks. The paper evaluates a two-stage method combining retrieval-oriented document optimization with context-adaptive claim integration. A safe defensive reproduction is to use only isolated benchmark corpora and inert…

SilentRetrieval: Hijacking Retrieval-Augmented Generation via Semantically-Preserving Adversarial Data Poisoning
Evaluated models: Llama 2 7B Chat, Mistral 7B Instruct v0.2, Qwen 7B Chat+1 more
  • Llama 2 7B Chat
  • Mistral 7B Instruct v0.2
  • Qwen 7B Chat
  • GPT-3.5 Turbo

Query-Agnostic Poisoning of Medical Multimodal RAG

Published Analyzed Source: arXiv

M3Att demonstrates a reproducible knowledge-poisoning issue in medical multimodal RAG: an attacker with limited corpus-distribution knowledge can insert paired image-text entries whose visually perturbed images are broadly retrieved and whose clinically plausible misinformation steers downstream generation. The paper evaluates both white-box and black-box retrieval optimization and reports degraded diagnostic and report-generation utility across multiple datasets, retrievers, and LVLMs. These…

Knowledge Poisoning Attacks on Medical Multi-Modal Retrieval-Augmented Generation
Evaluated models: GPT-4o, GPT-5 Chat, Gemini 2.5 Flash+5 more
  • GPT-4o
  • GPT-5 Chat
  • Gemini 2.5 Flash
  • Claude Haiku 4.5
  • LLaVA Med
  • CLIP ViT-Large-Patch14-336
  • BGE-VL-base
  • SigLIP-SO400M-Patch14-384

LLM Judge Manipulation

Published Analyzed Source: arXiv

Generative reward models deployed as LLM-as-a-Judge (LaaJ) evaluators contain a logic bypass vulnerability where superficial "master key" inputs trigger false positive rewards regardless of actual response quality. Instead of evaluating the candidate's output, large judge models are inadvertently triggered by specific token sequences to solve the prompt independently. This allows malicious actors or policy models undergoing reinforcement learning to consistently game the reward signal by…

Security in LLM-as-a-Judge: A Comprehensive SoK
Evaluated models: GPT-4o, o1, Qwen 2.5 72B Instruct+1 more
  • GPT-4o
  • o1
  • Qwen 2.5 72B Instruct
  • Llama 3 70B Instruct

NLG Poisoning Certification Gap

Published Analyzed Source: arXiv

Autoregressive Large Language Models (LLMs) utilizing standard fine-tuning (SFT) or alignment techniques (RLHF/DPO) are vulnerable to training-time data poisoning attacks that exploit the sequential nature of token generation. Unlike classification tasks, where output labels are independent, LLM generation suffers from a cascading vulnerability where modifying a single token $i$ intervenes on the distribution of all subsequent tokens $j > i$. An adversary can inject a small fraction of…

Towards Poisoning Robustness Certification for Natural Language Generation
Evaluated models: Gemma 2 2B

LLM Backdoor Trigger Reconstruction

Published Analyzed Source: arXiv

Large Language Models (LLMs) subjected to Supervised Fine-Tuning (SFT) are vulnerable to "sleeper agent" data poisoning attacks. An attacker injects specific trigger phrases into the training corpus, causing the model to learn a conditional policy: behaving normally for standard inputs but executing a malicious target behavior when the trigger is present. These backdoors persist through safety training and alignment. The vulnerability stems from the model's strong memorization of poisoning…

The Trigger in the Haystack: Extracting and Reconstructing LLM Backdoor Triggers
Evaluated models: Gemma 3 270M IT, DeepSeek R1 Distill Qwen 1.5B, Phi-4 Mini Instruct+4 more
  • Gemma 3 270M IT
  • DeepSeek R1 Distill Qwen 1.5B
  • Phi-4 Mini Instruct
  • Llama 3.1 8B Instruct
  • Phi-4 Reasoning Plus
  • Llama 2 7B Backdoor DEPLOYMENT
  • OpenHermes 13B Backdoor DEPLOYMENT

Unified Robustness Gap

Published Analyzed Source: arXiv

Text scoring models, including dense retrievers, rerankers, and reward models, are vulnerable to score manipulation attacks via search-based discrete perturbations and content injection. An attacker can systematically modify candidate texts using rudimentary string manipulations, gradient-guided token swaps (e.g., HotFlip), masked language modeling (MLM) swaps, or query/sentence injections to spuriously increase model scores. This structural failure condition allows an irrelevant passage or a…

Unifying Adversarial Robustness and Training Across Text Scoring Models
Evaluated models: E5 BERT-base, Qwen 3 0.6B, Llama 3.2 3B Instruct+2 more
  • E5 BERT-base
  • Qwen 3 0.6B
  • Llama 3.2 3B Instruct
  • Llama 3.1 8B Instruct
  • Skywork Reward V2

Single Word Rank Promotion

Published Analyzed Source: arXiv

Neural Ranking Models (NRMs) utilizing Transformer architectures (specifically BERT and T5-based re-rankers) are vulnerable to minimal adversarial perturbations that artificially promote a target document's rank. The vulnerability allows an attacker to manipulate ranking outcomes by inserting or substituting a single "query center" token—a word identified as the semantic centroid of the user's query—into the target document. The attack exploits the model's sensitivity to specific semantic…

One Word is Enough: Minimal Adversarial Perturbations for Neural Text Ranking
Evaluated models: Not reported

Research methodology

Entries summarize publicly available primary-source security research. Model names reflect only systems explicitly evaluated by the cited paper, and measurements are research-reported unless independent verification is stated.

Discovery and publication are separate: new papers enter a candidate queue, then require human review and explicit approval before publication. Updates follow that review process, not a guaranteed daily publishing schedule. “Last analyzed” is the newest analysis date among published entries; it does not mean that all recent research has been covered.