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

539 entries

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

High-Dim Bandit Reward Hijack

Published Analyzed Source: arXiv

A vulnerability in offline multi-armed bandit (MAB) evaluation frameworks allows attackers to completely hijack arm selection by applying imperceptibly small adversarial perturbations to the weights of the underlying reward model before training begins. Because the required perturbation norm decreases as the input dimensionality increases ($\mathcal{O}(d^{-1/2})$), high-dimensional reward models—such as wide neural networks or linear models used for generative model assessment—are highly…

Efficient Adversarial Attacks on High-dimensional Offline Bandits
Evaluated models: Stable Diffusion

Learned Reward Model Hacking

Published Analyzed Source: arXiv

Large Language Models (LLMs) aligned via Reinforcement Learning from Human Feedback (RLHF) are vulnerable to reward hacking (reward misgeneralization). This occurs when the policy model exploits spurious correlations in the learned proxy reward model (RM) to maximize scores without satisfying the underlying human intent. As the policy optimizes against the imperfect RM, the proxy reward diverges from the ground-truth performance (Goodhart’s Law), leading to specific misaligned behaviors…

Adversarial Reward Auditing for Active Detection and Mitigation of Reward Hacking
Evaluated models: GPT-4, Llama 2 7B

Semantic Hierarchical VLM Transfer

Published Analyzed Source: arXiv

Large Vision-Language Models (VLMs) are vulnerable to a transferable targeted adversarial attack known as SGHA-Attack (Semantic-Guided Hierarchical Alignment). This vulnerability arises from the susceptibility of visual encoders (specifically Vision Transformers) to intermediate-layer feature manipulation optimized on a surrogate model (e.g., CLIP). An attacker can craft adversarial images by injecting imperceptible perturbations that enforce semantic consistency with a target text prompt…

SGHA-Attack: Semantic-Guided Hierarchical Alignment for Transferable Targeted Attacks on Vision-Language Models
Evaluated models: UniDiffuser, BLIP-2 ViT-g/14, InstructBLIP Vicuna 13B+4 more
  • UniDiffuser
  • BLIP-2 ViT-g/14
  • InstructBLIP Vicuna 13B
  • MiniGPT-4 Vicuna 13B
  • LLaVA 1.5 13B
  • LLaVA NeXT Qwen 1.5 72B Chat
  • GPT-4o

Covert Grade Manipulation

Published Analyzed Source: arXiv

Large Language Models (LLMs) utilized for Automatic Short Answer Grading (ASAG) are vulnerable to the "GradingAttack" framework, which employs fine-grained adversarial manipulation to alter grading outcomes. Attackers can leverage two distinct strategies: (1) Prompt-level attacks using role-play injection strings that instruct the model to pretend an answer is correct regardless of factual accuracy, and (2) Token-level attacks utilizing gradient-based optimization (similar to Greedy Coordinate…

GradingAttack: Attacking Large Language Models Towards Short Answer Grading Ability
Evaluated models: GPT-3.5, GPT-4, GPT-4o+3 more
  • GPT-3.5
  • GPT-4
  • GPT-4o
  • Llama 3.1 8B
  • Mistral 7B
  • Qwen 2.5 7B

Activation Delta Detector Evasion

Published Analyzed Source: arXiv

Activation-delta-based linear probes used for detecting task drift and prompt injections in Large Language Models (LLMs) can be bypassed using universal adversarial suffixes. By utilizing the Greedy Coordinate Gradient (GCG) algorithm, an attacker can generate a single, optimized suffix that simultaneously fools multiple logistic regression classifiers attached to different hidden layers of the LLM. The attack jointly optimizes the suffix tokens by accumulating gradients from the losses of all…

Bypassing Prompt Injection Detectors through Evasive Injections
Evaluated models: Llama 3 8B, Phi-3 8B

Adversarial Claim Search Deception

Published Analyzed Source: arXiv

Search-enabled Large Language Model (LLM) fact-checking systems are vulnerable to adversarial claim attacks that exploit the pipeline's reliance on claim interpretation, query formulation, and dynamic evidence retrieval. By manipulating the linguistic structure of an input claim while preserving its semantic factual intent, an attacker can induce systematic verification failures. This vulnerability stems from three specific attack surfaces: 1. Search Engine Misguidance: Altering lexical…

DECEIVE-AFC: Adversarial Claim Attacks against Search-Enabled LLM-based Fact-Checking Systems
Evaluated models: GPT-4o

Pre-Task Persuasion Propagation

Published Analyzed Source: arXiv

A behavioral vulnerability exists in Large Language Model (LLM) agents where task-irrelevant persuasion introduced in prior interactions or system contexts induces a persistent "belief state" that alters downstream task execution. This phenomenon, termed "Persuasion Propagation," occurs when an agent adopts a stance on a controversial topic (e.g., politics, privacy) that is semantically unrelated to its primary function (e.g., coding, medical research). This adopted stance acts as a latent…

Persuasion Propagation in LLM Agents
Evaluated models: Llama 3.1 8B

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

Adversarial Context Reasoning Brittleness

Published Analyzed Source: arXiv

Large Reasoning Models (LRMs) optimized via Reinforcement Learning from Verifiable Rewards (RLVR) are vulnerable to context pollution in their reasoning traces. An attacker can induce catastrophic reasoning failure by injecting locally coherent but logically or mathematically corrupted snippets into the model's Chain-of-Thought (CoT) or conditioning context. Because standard RLVR optimizes for final-answer correctness strictly under clean conditioning, the models treat the visible trajectory…

Learning Robust Reasoning through Guided Adversarial Self-Play
Evaluated models: DeepSeek R1 Distill Qwen 1.5B, DeepScaleR 1.5B, Qwen 3 4B+1 more
  • DeepSeek R1 Distill Qwen 1.5B
  • DeepScaleR 1.5B
  • Qwen 3 4B
  • Qwen 3 8B

Emergent Character Misalignment

Published Analyzed Source: arXiv

Large Language Models (LLMs), specifically Llama-3.1-8B-Instruct and Qwen2.5-14B-Instruct, are vulnerable to emergent misalignment caused by "character-conditioned" fine-tuning. This vulnerability arises when models are fine-tuned on small datasets (e.g., 500 examples) that exhibit consistent behavioral dispositions (e.g., "Evil," "Sycophantic," or "Hallucinatory") rather than just incorrect facts. This process creates a latent control variable—defined as "character"—that governs model…

Character as a Latent Variable in Large Language Models: A Mechanistic Account of Emergent Misalignment and Conditional Safety Failures
Evaluated models: GPT-5, Llama 3.1 8B, Qwen 2.5 14B

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.