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

5 entries

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

LLM Prefix Cache Reconstruction

Published Analyzed Source: arXiv

Automatic Prefix Caching (APC) in multi-tenant LLM serving systems introduces a timing side-channel vulnerability that permits cross-tenant data leakage. APC shares computed Key-Value (KV) tensors across different users when their requests share identical initial tokens. Because reusing cached tensors is significantly faster than recomputing them, a measurable difference in Time-To-First-Token (TTFT) exists between cache hits and misses. An attacker can exploit this shared cache by sending…

PrefixWall: Mitigating Prefix Caching Side Channels in Shared LLM Systems
Evaluated models: Gemma 3 4B IT, Llama 2 7B Chat, Llama 2 13B Chat+6 more
  • Gemma 3 4B IT
  • Llama 2 7B Chat
  • Llama 2 13B Chat
  • LLaVA OneVision Qwen2 0.5B
  • LLaVA OneVision Qwen2 7B Chat
  • Qwen2-VL 2B Instruct
  • Qwen2-VL 7B Instruct
  • Qwen 2.5 VL 3B Instruct
  • Qwen 2.5 VL 7B Instruct

Efficient KV-Cache Prompt Leakage

Published Analyzed Source: arXiv

A vulnerability in multi-tenant LLM serving frameworks allows attackers to reconstruct the private prompts of other users via an active Key-Value (KV) cache side-channel. Frameworks that utilize shared KV caches alongside specific scheduling policies, such as Longest Prefix Match (LPM), prioritize waiting requests based on the length of their matched prefix tokens. An attacker can exploit this by iteratively sending batches of guessed tokens mixed with dummy queries. If a guessed token matches…

OptiLeak: Efficient Prompt Reconstruction via Reinforcement Learning in Multi-tenant LLM Services
Evaluated models: Llama 3.1 8B, Qwen 2.5 3B

Fill-Squeeze Scheduler DoS

Published Analyzed Source: arXiv

LLM serving frameworks utilizing continuous batching and PagedAttention (such as vLLM, SGLang, and Orca) are vulnerable to a resource exhaustion Denial-of-Service attack known as "Fill and Squeeze." An unprivileged remote attacker can exploit the deterministic state transitions of the scheduler's memory management to induce severe latency or service denial. The attack leverages a side-channel vulnerability where Inter-Token Latency (ITL) correlates linearly with global KV-cache usage due to…

Rethinking Latency Denial-of-Service: Attacking the LLM Serving Framework, Not the Model
Evaluated models: Qwen 3 8B, Gemma 3 12B IT, DeepSeek R1 Distill Llama 8B+1 more
  • Qwen 3 8B
  • Gemma 3 12B IT
  • DeepSeek R1 Distill Llama 8B
  • Llama 3.1 8B Instruct

KV-Cache Sharing Timing Side-channel

Published Analyzed Source: arXiv

Multi-tenant Large Language Model (LLM) inference systems utilizing global Key-Value (KV) cache sharing are vulnerable to a timing side-channel attack. By measuring the Time-To-First-Token (TTFT) latency of crafted API requests, an unprivileged remote attacker can determine if specific token sequences have been previously processed and cached by the system for other users. This observable timing difference between cache hits (low TTFT) and cache misses (high TTFT) allows for the token-by-token…

Selective KV-Cache Sharing to Mitigate Timing Side-Channels in LLM Inference
Evaluated models: Phi-4 14B, Qwen 3 30B-A3B, Qwen 3 32B+3 more
  • Phi-4 14B
  • Qwen 3 30B-A3B
  • Qwen 3 32B
  • Llama 3.3 70B Instruct
  • Qwen 3 235B-A22B
  • DeepSeek R1

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.