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

7 entries

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

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

CoT Prefix Jailbreak

Published Analyzed Source: arXiv

A vulnerability exists in Large Language Model (LLM) and Large Reasoning Model (LRM) serving interfaces that allow user-defined response prefixes, such as plain text-completion (v1/completions), Fill-in-the-Middle (FIM), or assistant message prefilling. An attacker can perform a Response Prefix Attack (RPA) by injecting maliciously crafted Chain-of-Thought (CoT) reasoning tokens immediately following the assistant's start delimiter (e.g., <|im_start|>assistant). Because these tokens are placed…

What Matters For Safety Alignment?
Evaluated models: DeepSeek V3.2, Gemini 3 Pro Preview, Gemini 3 Flash Preview+4 more
  • DeepSeek V3.2
  • Gemini 3 Pro Preview
  • Gemini 3 Flash Preview
  • Grok 4.1 Fast
  • Claude Sonnet 4.5
  • GPT-5.2
  • GPT-4o Mini

Aggressive Compression Model Theft

Published Analyzed Source: arXiv

Large Language Models (LLMs) hosted on inference servers are vulnerable to high-speed weight exfiltration attacks due to the inherent compressibility of transformer parameters when decompression constraints are relaxed. Adversaries with compromised server access can utilize aggressive lossy compression techniques—specifically additive quantization combined with k-means clustering—to reduce model size by factors of 16x to 100x (e.g., <1 bit per parameter). Unlike standard quantization for…

Aggressive Compression Enables LLM Weight Theft
Evaluated models: Qwen 2 1.5B, Qwen 2 7B, Qwen 2.5 0.5B+2 more
  • Qwen 2 1.5B
  • Qwen 2 7B
  • Qwen 2.5 0.5B
  • Qwen 2.5 1.5B
  • Pythia 70M

Leaked Bits Collapse Attack Queries

Published Analyzed Source: arXiv

Large Language Models (LLMs), specifically variants of GPT-4o, DeepSeek-R1, OLMo-2, and Llama-4, are vulnerable to accelerated adaptive adversarial attacks due to excessive information leakage in observable output signals. When these models expose "thinking processes" (Chain-of-Thought traces) or token-level log-probabilities (logits) to the end user, they leak significant mutual information $I(Z;T)$ regarding the model's safety state or hidden instructions. This leakage allows adaptive attack…

Bits Leaked per Query: Information-Theoretic Bounds on Adversarial Attacks against LLMs
Evaluated models: DeepSeek R1, GPT-4o Mini 2024-07-18, Llama 4 Maverick 17B+4 more
  • DeepSeek R1
  • GPT-4o Mini 2024-07-18
  • Llama 4 Maverick 17B
  • Llama 4 Scout 17B
  • OLMo 2 7B-1124
  • OLMo 2 13B-1124
  • OLMo 2 32B-0325

Fine-Tuning Safety Subspace Erosion

Published Analyzed Source: arXiv

Large Language Models (LLMs) aligned via techniques such as Reinforcement Learning with Human Feedback (RLHF) or Direct Preference Optimization (DPO) contain a vulnerability in how safety features are encoded within the model parameters. The safety-critical information is primarily stored in low-rank subspaces of the weight matrices (specifically, the difference between the base and aligned model weights). These low-rank subspaces are highly sensitive to parameter updates. Consequently…

Lox: Low-rank extrapolation robustifies llm safety against fine-tuning
Evaluated models: GPT-3.5, Llama 2 7B, Mistral 7B

LLM Judge Subversion

Published Analyzed Source: arXiv

Alibaba Cloud PAI-Judge and PAI-Judge-Plus are vulnerable to a composite adversarial attack that exploits attention mechanism limitations in Large Language Models (LLMs). An authenticated attacker can manipulate automated evaluation outcomes by appending a long, irrelevant text suffix (approximately 1000 to 2000+ characters) to a response containing adversarial perturbations. This "long-suffix" strategy overwhelms the judge model's context window, causing the attention mechanism to degrade and…

LLMs Cannot Reliably Judge (Yet?): A Comprehensive Assessment on the Robustness of LLM-as-a-Judge
Evaluated models: GPT-4o, Llama 3.1 8B, Llama 3.3 70B+3 more
  • GPT-4o
  • Llama 3.1 8B
  • Llama 3.3 70B
  • Mistral 7B
  • DeepSeek R1
  • Qwen 2.5 7B

Guardrail Bypass Harmful Fine-tuning

Published Analyzed Source: arXiv

The Virus attack method enables attackers to bypass guardrail moderation on fine-tuning data, leading to a significant degradation of safety alignment in large language models (LLMs). This is achieved through a dual-objective data optimization strategy that crafts harmful data undetectable by the guardrail while maximizing their effectiveness in compromising the victim model's safety.

Virus: Harmful Fine-tuning Attack for Large Language Models Bypassing Guardrail Moderation
Evaluated models: Llama 3 8B, Llama Guard 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.