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

228 entries

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

Gradient Shift Jailbreak

Published Analyzed Source: arXiv

Large Language Models (LLMs) and Large Reasoning Models (LRMs) are vulnerable to an inference-time jailbreak attack known as "Hybrid Gradient Shift." This vulnerability exploits the statistical discrepancy between an aligned model's output distribution and a pre-alignment reference distribution. By treating safety alignment as a form of miscalibration, an attacker can aggregate the logits of a target model (aligned), a helper model (unaligned/weak), and a predictor model to reconstruct the…

Jailbreaking LLMs via Calibration
Evaluated models: GPT-oss 120B, Llama 3.3 70B Instruct

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

Attention Breaks Concept Resistance

Published Analyzed Source: arXiv

A vulnerability exists in the internal representation mechanisms of Transformer-based Large Language Models (LLMs), specifically Llama-3 and Qwen series models. The vulnerability allows for high-accuracy "steering" of model outputs, effectively bypassing safety guardrails and refusal mechanisms (jailbreaking) without modifying model weights. By exploiting attention-guided feature learning, an attacker can extract a precise "concept vector" representing refusal behaviors. This is achieved by…

Efficient and accurate steering of Large Language Models through attention-guided feature learning
Evaluated models: Llama 3.1 8B, Llama 3.3 70B, Qwen 2.5 14B

Semantics-Preserving Detector Evasion

Published Analyzed Source: arXiv

LLM-based vulnerability detection systems (used in static application security testing and code review pipelines) are susceptible to semantics-preserving adversarial evasion attacks. Attackers can bypass detection mechanisms by injecting gradient-optimized "universal adversarial strings" into specific code regions—defined as "carriers"—that do not alter the program's compilation or execution logic. These carriers include non-executable regions (code comments, inactive preprocessor directives)…

Syntax- and Compilation-Preserving Evasion of LLM Vulnerability Detectors
Evaluated models: Qwen 2.5 Coder 14B, Qwen 2.5 Coder 32B, Llama 3.1 8B+4 more
  • Qwen 2.5 Coder 14B
  • Qwen 2.5 Coder 32B
  • Llama 3.1 8B
  • CodeAstra
  • StarCoder2 15B
  • GPT-4o
  • GPT-5 Mini

LLM Router Rerouting

Published Analyzed Source: arXiv

LLM routing systems are vulnerable to adversarial rerouting attacks where malicious triggers prepended to user queries manipulate the router's model-selection mechanism. Because LLM routers function as classifiers evaluating query complexity to balance computational cost and response quality, an attacker can craft adversarial prefixes that distort the query's latent semantic representation. This exploits the router's decision boundaries, forcing the system to misclassify the input and redirect…

RerouteGuard: Understanding and Mitigating Adversarial Risks for LLM Routing
Evaluated models: GPT-4, GPT-4o, GPT-5+2 more
  • GPT-4
  • GPT-4o
  • GPT-5
  • Llama 3 8B
  • Mixtral 8x7B

Visual Compression Mismatch Attack

Published Analyzed Source: arXiv

A vulnerability exists in Large Vision-Language Models (LVLMs) utilizing visual token compression mechanisms (e.g., VisionZip, VisPruner) to reduce inference latency. The vulnerability stems from an optimization-inference mismatch where standard adversarial defenses assume full-token processing, while the deployed model utilizes a subset of tokens selected via importance metrics (typically attention scores).

On the Adversarial Robustness of Large Vision-Language Models under Visual Token Compression
Evaluated models: LLaVA 1.5 7B

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

RL Adversarial Function Call

Published Analyzed Source: arXiv

Large Language Models (LLMs) enabled with Function Calling (FC) capabilities are vulnerable to adversarial query rewriting and semantic manipulation. Standard FC models, typically trained via Supervised Fine-Tuning (SFT) on static datasets, fail to generalize against adversarial inputs that deviate from fixed distribution patterns. An attacker can exploit this by crafting queries that are semantically similar to valid requests but engineered to induce "bad cases," such as incorrect tool…

Exploring Weaknesses in Function Call Models via Reinforcement Learning: An Adversarial Data Augmentation Approach
Evaluated models: Qwen 2.5 7B Instruct, Qwen 3 0.6B, Qwen 3 4B+1 more
  • Qwen 2.5 7B Instruct
  • Qwen 3 0.6B
  • Qwen 3 4B
  • Qwen 3 8B

Refusal Prefix Unlearning

Published Analyzed Source: arXiv

A fine-tuning vulnerability in the safety alignment of Large Language Models (LLMs) allows adversaries to systematically bypass refusal mechanisms by training the model on a small dataset (as few as 1,000 samples) of strictly benign text. By prepending standard refusal prefixes (e.g., "I'm sorry", "I cannot fulfill this request") to the target outputs of benign instruction-response pairs, attackers disrupt the model's refusal completion pathway. When subsequently prompted with unsafe queries…

LLMs Can Unlearn Refusal with Only 1,000 Benign Samples
Evaluated models: Llama 2 13B, Llama 3.1 8B, Llama 3.2 1B+13 more
  • Llama 2 13B
  • Llama 3.1 8B
  • Llama 3.2 1B
  • Llama 3.3 70B
  • Qwen 2 7B
  • Qwen 2.5 32B
  • Qwen 3 0.6B
  • Qwen 3 4B Think
  • Gemma 1.1 7B
  • Gemma 2 2B
  • Gemma 2 9B
  • Gemma 2 27B
  • GPT-oss 20B
  • GPT-4.1 Nano
  • Gemini 2.0 Flash-Lite
  • Gemini 2.5 Flash-Lite

Attention Exposes Membership

Published Analyzed Source: arXiv

Transformer-based Large Language Models (LLMs) contain a privacy vulnerability within their self-attention mechanisms that allows for Membership Inference Attacks (MIA). Pre-training induces distinct, highly structured, and concentrated attention patterns for data samples included in the training set, differentiating them from non-member samples which exhibit noisier, less consistent attention flows. An attacker with white-box access to the model parameters (specifically attention weight…

AttenMIA: LLM Membership Inference Attack through Attention Signals
Evaluated models: Llama 2 7B, Llama 2 13B, Pythia 1.4B+11 more
  • Llama 2 7B
  • Llama 2 13B
  • Pythia 1.4B
  • Pythia 2.8B
  • Pythia 6.9B
  • Pythia 12B
  • GPT-NeoX 20B
  • OPT 1.3B
  • OPT 2.7B
  • OPT 6.7B
  • OPT 13B
  • OPT 30B
  • OPT 66B
  • GPT-2

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.