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

24 entries

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

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

Query-Agnostic Retrieval Poisoning

Published Analyzed Source: arXiv

A vulnerability in Large Language Model-based Retrieval (LLMR) systems allows attackers to intentionally hide specific documents from being retrieved (e.g., in RAG pipelines or search engines) by appending a small number of adversarially crafted, query-agnostic tokens. The attack operates in a complete black-box setting: it requires no knowledge of the victim's queries, the target retrieval model's parameters, or the underlying document corpus. By utilizing Document-Query Adversarial (DQ-A)…

" Someone Hid It": Query-Agnostic Black-Box Attacks on LLM-Based Retrieval
Evaluated models: Mistral 7B, Qwen 2.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

Optimized Indirect Prompt Injection Crosses Retrieval Barrier

Published Analyzed Source: arXiv

The paper describes a reproducible black-box indirect prompt injection evaluation for embedding-based RAG and agent systems. It separates a poisoned document into a retrieval-optimized trigger fragment and an instruction-bearing attack fragment, showing that one injected item can be surfaced by natural queries and then influence model output or agent behavior. These are paper-reported findings; they were not independently verified here.

Overcoming the Retrieval Barrier: Indirect Prompt Injection in the Wild for LLM Systems
Evaluated models: GPT-4o, GPT-4o Mini, Qwen 3 0.6B+19 more
  • GPT-4o
  • GPT-4o Mini
  • Qwen 3 0.6B
  • Qwen 3 1.7B
  • Qwen 3 4B
  • Qwen 3 8B
  • Qwen3-11B
  • Qwen 3 32B
  • Llama 3.2 3B
  • Llama 3.2 3B Instruct
  • Llama 3 8B
  • Llama 3 8B Instruct
  • Vicuna 7B
  • Vicuna 13B
  • gte-modernbert-base
  • OpenAI text-embedding-3-small
  • Voyage AI voyage-3.5-lite
  • Alibaba Cloud text-embedding-v4
  • contriever-msmarco
  • Qwen3-Embedding-0.6B
  • Qwen3-Embedding-4B
  • Qwen3-Embedding-8B

Semantic Intention Obfuscation

Published Analyzed Source: arXiv

The KG-DF (Knowledge Graph Defense Framework) contains a logic vulnerability in its Semantic Parsing Module, specifically within the keyword extraction phase defined as $K_{core} = \text{LLM}(P_{prompt})$. The framework relies on a Large Language Model (e.g., GPT-3.5-turbo) to distill user input into keywords ($K_{core}$), which are then embedded to retrieve security warning triples ($T_{match}$) from a Knowledge Graph.

KG-DF: A Black-box Defense Framework against Jailbreak Attacks Based on Knowledge Graphs
Evaluated models: GPT-3.5, GPT-4, Llama 2 7B+1 more
  • GPT-3.5
  • GPT-4
  • Llama 2 7B
  • Vicuna 7B

Latent Space Discontinuity Exploitation

Published Analyzed Source: arXiv

A vulnerability exists in certain Large Language Models and diffusion models due to discontinuities in their latent space, which arise from data sparsity during training. An attacker can craft inputs containing lexically rare or semantically ambiguous constructs to guide the model's inference process toward these unstable, poorly-conditioned regions. This technique, termed "Alignment Degradation Induction," can degrade or bypass safety alignment mechanisms. Through iterative, multi-turn…

Exploiting Latent Space Discontinuities for Building Universal LLM Jailbreaks and Data Extraction Attacks
Evaluated models: Not reported

Black-Box RAG Rank Hijack

Published Analyzed Source: arXiv

Retrieval-Augmented Generation (RAG) systems utilizing dense (e.g., BERT-based) or sparse (e.g., BM25) retrievers are vulnerable to black-box adversarial prompt injection attacks. By employing a gradient-free Differential Evolution (DE) optimization algorithm (referred to as DeRAG), an attacker can generate short adversarial suffixes (typically ≤ 5 tokens). When these suffixes are appended to a user query, they manipulate the retriever's ranking mechanism to promote a specific, malicious, or…

DeRAG: Black-box Adversarial Attacks on Multiple Retrieval-Augmented Generation Applications via Prompt Injection
Evaluated models: Not reported

Agent Tool Selection Hijack

Published Analyzed Source: arXiv

A vulnerability exists in the tool selection mechanism of Large Language Model (LLM) agents that utilize a retrieval-then-selection pipeline (RAG) for identifying executable tools. The vulnerability, known as "ToolHijacker," allows a remote attacker to manipulate the agent's decision-making process by injecting a malicious tool document into the accessible tool library (e.g., via third-party tool hubs or plugins). The attack employs a two-phase optimization strategy to craft a malicious tool…

Prompt Injection Attack to Tool Selection in LLM Agents
Evaluated models: Llama 2 7B Chat, Llama 3 8B Instruct, Llama 3 70B Instruct+5 more
  • Llama 2 7B Chat
  • Llama 3 8B Instruct
  • Llama 3 70B Instruct
  • Llama 3.3 70B Instruct
  • Claude 3 Haiku
  • Claude 3.5 Sonnet
  • GPT-3.5
  • GPT-4o

Single-Shot RAG Poisoning

Published Analyzed Source: arXiv

Retrieval-Augmented Generation (RAG) systems are vulnerable to a targeted corpus poisoning attack known as "CorruptRAG". This vulnerability allows an attacker to manipulate the response of an LLM to a specific target query by injecting a single malicious document into the RAG knowledge database. Unlike traditional poisoning attacks that require flooding the retrieval results (top-N) with malicious content to outnumber correct information, CorruptRAG succeeds with a single retrieved document.

Practical poisoning attacks against retrieval-augmented generation
Evaluated models: GPT-3.5, GPT-4, GPT-4o

Zero-Shot Embedding Leak

Published Analyzed Source: arXiv

A Universal Zero-shot Embedding Inversion vulnerability exists in vector databases and embedding-based retrieval systems. The flaw allows an attacker to reconstruct original plaintext documents from their vector embeddings without requiring access to the original training data or training an embedding-specific inversion model. The attack, identified as "ZSinvert," leverages a multi-stage adversarial decoding process: (1) a cosine-similarity guided beam search using a Large Language Model (LLM)…

Universal Zero-shot Embedding Inversion
Evaluated models: Qwen 2 5B

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.