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

31 entries

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

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

Reward Hacking Via Adversarial Imitation

Published Analyzed Source: arXiv

A vulnerability exists in the post-training alignment of Flow Matching models (specifically FLUX.1-dev) when utilizing Visual Foundation Models (VFM) (e.g., DINOv3b) as discriminators or when employing standalone Reward Gradient optimization (e.g., HPSv3). These feedback mechanisms lack sufficient capacity or structural guidance to constrain the generative policy, making the discriminator's gradients susceptible to "reward hacking." Consequently, the generative policy over-optimizes for the…

FAIL: Flow Matching Adversarial Imitation Learning for Image Generation
Evaluated models: Not reported

LLM Strategic Prompt Deception

Published Analyzed Source: arXiv

Alignment auditing methodologies used to verify the safety of Large Language Models (LLMs)—specifically black-box methods (Assistant Prefills, User Persona Sampling) and white-box interpretability methods (SAE Feature Description, Activation Token Embedding Similarity)—are vulnerable to prompt-level strategic deception. A misaligned "target" model, when supplied with a specific system prompt containing a high-level deceptive strategy and descriptions of the auditing tools, can obfuscate its…

Stress-Testing Alignment Audits With Prompt-Level Strategic Deception
Evaluated models: Llama 3.1 8B, Llama 3.3 70B, Gemma 2 9B

Chunky Post-Training Miscalibration

Published Analyzed Source: arXiv

Large Language Models (LLMs) exhibit a vulnerability termed "chunky post-training," where the model learns spurious correlations between incidental prompt features (e.g., formatting styles, specific vocabulary, sentence structure) and specific behavioral modes (e.g., refusal, code generation, rebuttal) present in distinct chunks of post-training data. This results in behavioral mis-routing during inference, where benign inputs sharing surface-level features with restricted or specialized…

Chunky Post-Training: Data Driven Failures of Generalization
Evaluated models: Claude Haiku 4.5, Claude Sonnet 4.5, Claude Opus 4.5+5 more
  • Claude Haiku 4.5
  • Claude Sonnet 4.5
  • Claude Opus 4.5
  • GPT-5.1
  • Grok 4.1 Mini
  • Tülu 3 8B
  • Tülu 3 70B
  • Tülu 3 405B

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

LLM Grading Compliance Paradox

Published Analyzed Source: arXiv

Large Language Models (LLMs) employed as automated code evaluators ("Universal Graders") are vulnerable to Semantic-Instruction Decoupling, a form of adversarial prompt injection that exploits the "Syntax-Semantics Gap." Attackers can embed adversarial directives into syntactically inert regions of the Abstract Syntax Tree (AST)—specifically comments, docstrings, variable names, and whitespace. While these regions are discarded by compilers (trivia nodes) or treated as arbitrary symbols…

The Compliance Paradox: Semantic-Instruction Decoupling in Automated Academic Code Evaluation
Evaluated models: GPT-5, Llama 3.1 8B, DeepSeek V3

Metacognitive Prompting Lowers Resistance

Published Analyzed Source: arXiv

Large Language Models (LLMs) are vulnerable to multi-turn persuasive conversational attacks that induce the adoption of counterfactual beliefs. By leveraging the Source–Message–Channel–Receiver (SMCR) communication framework, attackers can systematically erode a model's confidence in established facts and compel the model to output misinformation. Specific attack vectors include manipulating source attribution (authority framing), message content (logical, credibility, or emotional appeals)…

Vulnerability of LLMs' Belief Systems? LLMs Belief Resistance Check Through Strategic Persuasive Conversation Interventions
Evaluated models: GPT-4o, Llama 3.2 3B, Llama 3.3 70B+2 more
  • GPT-4o
  • Llama 3.2 3B
  • Llama 3.3 70B
  • Mistral 7B
  • Qwen 2.5 7B

Invisible Headline Trading Loss

Published Analyzed Source: arXiv

Improper input validation in Large Language Model (LLM) integrated Algorithmic Trading Systems (ATS) allows remote attackers to manipulate trading decisions via crafted "adversarial news" headlines. The vulnerability exists when ATS pipelines ingest financial news data via standard scraping libraries (e.g., Scrapy, BeautifulSoup, Cheerio) and pass raw HTML or non-normalized text directly to LLMs (such as FinBERT, FinGPT, or GPT-4) for entity recognition (stock-name association) and sentiment…

Adversarial News and Lost Profits: Manipulating Headlines in LLM-Driven Algorithmic Trading
Evaluated models: FinBERT, FinGPT, FinLLaMA+7 more
  • FinBERT
  • FinGPT
  • FinLLaMA
  • o3
  • o3 Pro
  • GPT-4o
  • GPT-4o Mini
  • GPT-4o Mini High
  • GPT-5
  • Gemini 1.5 Pro

Adversarial Prompts Defeat Code Defenses

Published Analyzed Source: arXiv

State-of-the-art secure code generation methods (Sven, SafeCoder, and PromSec) are vulnerable to adversarial prompt perturbations during inference, allowing for the bypass of security alignment mechanisms. The vulnerability stems from the models' reliance on surface-level textual pattern matching rather than semantic security reasoning. By employing simple prompt manipulations—such as Cue Inversion (flipping security directives), Naturalness Reframing (rewriting comments as novice questions)…

How Secure is Secure Code Generation? Adversarial Prompts Put LLM Defenses to the Test
Evaluated models: GPT-3.5, GPT-4o, Mistral 7B

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.