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

26 entries

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

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

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

Quantization Contrastive Jailbreak

Published Analyzed Source: arXiv

A malicious model supply chain vulnerability exists involving a technique termed Adversarial Contrastive Learning (ACL) for Large Language Model (LLM) quantization attacks. This vulnerability allows an attacker to publish a model that appears benign and preserves high utility in full precision (e.g., BF16 or FP32) but exhibits malicious behaviors—such as jailbreak, over-refusal, or advertisement injection—immediately upon zero-shot quantization (e.g., INT8, FP4, or NF4).

Adversarial Contrastive Learning for LLM Quantization Attacks
Evaluated models: Qwen 2.5 1.5B Instruct, Qwen 2.5 3B Instruct, Llama 3.2 1B Instruct+1 more
  • Qwen 2.5 1.5B Instruct
  • Qwen 2.5 3B Instruct
  • Llama 3.2 1B Instruct
  • Llama 3.2 3B Instruct

LoRA Unverified Product Poisoning

Published Analyzed Source: arXiv

In distributed Low-Rank Adaptation (LoRA) fine-tuning systems, a structural verification blind spot exists due to the decoupled aggregation of low-rank matrices. Frameworks typically evaluate and aggregate the $A$ and $B$ matrices independently to reduce computational overhead. A malicious client can exploit this by submitting individually benign $A$ and $B$ matrices that satisfy standard norm-based and similarity-based anomaly detection filters, but whose composite product ($A \times B$)…

Low Rank Comes with Low Security: Gradient Assembly Poisoning Attacks against Distributed LoRA-based LLM Systems
Evaluated models: ChatGLM2 6B, GPT-2 124M, Llama 7B+2 more
  • ChatGLM2 6B
  • GPT-2 124M
  • Llama 7B
  • Llama 13B
  • Llama 33B

Prompt Injection Alignment Bypass

Published Analyzed Source: arXiv

Large Language Models (LLMs) integrated with external retrieval mechanisms (e.g., Retrieval-Augmented Generation (RAG), web search, or email processing) are vulnerable to Indirect Prompt Injection. This vulnerability occurs when an LLM consumes input from untrusted external sources—such as websites, code repositories, or incoming emails—that contain embedded adversarial prompts. Unlike direct injection, where the user attacks the model, here the "poisoned" data is retrieved by the system…

Breaking to Build: A Threat Model of Prompt-Based Attacks for Securing LLMs
Evaluated models: Not reported

Life-Cycle Router Misrouting

Published Analyzed Source: arXiv

Predictive Large Language Model (LLM) routers, specifically those utilizing Deep Neural Network (DNN) and Matrix Factorization (MF) architectures, are vulnerable to adversarial manipulation and backdoor poisoning. These routers are designed to optimize cost and latency by dynamically directing simple queries to "weak" (cheap) models and complex queries to "strong" (expensive) models. Attackers can exploit this mechanism in two ways: 1. Inference-time Attacks: By appending specific adversarial…

Life-Cycle Routing Vulnerabilities of LLM Router
Evaluated models: Not reported

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

FedPEFT Evasion Attack

Published Analyzed Source: arXiv

A vulnerability exists in Federated Parameter-Efficient Fine-Tuning (FedPEFT) systems for large language models (LLMs). Malicious clients can exploit the PEFT mechanism (e.g., LoRA, (IA)³, LayerNorm) to inject adversarial training data, compromising the model's safety alignment even with a small percentage of trainable parameters and a minority of malicious participants. The attack, termed "PEFT-as-an-Attack" (PaaA), circumvents the LLM's safety guardrails, causing it to generate harmful…

PEFT-as-an-Attack! Jailbreaking Language Models during Federated Parameter-Efficient Fine-Tuning
Evaluated models: Llama 2 7B Chat, Llama 3.2 3B Instruct, Phi-3.5 Mini Instruct+1 more
  • Llama 2 7B Chat
  • Llama 3.2 3B Instruct
  • Phi-3.5 Mini Instruct
  • Qwen 2.5 7B Instruct

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.