CRARLGApr 19

Bit-Flip Vulnerability of Shared KV-Cache Blocks in LLM Serving Systems

arXiv:2604.172498.8h-index: 4
Predicted impact top 83% in CR · last 90 daysOriginality Incremental advance
AI Analysis

For LLM serving system operators, this reveals a critical security gap in shared KV-cache blocks that could be exploited before end-to-end attacks are demonstrated.

This paper identifies a new vulnerability in LLM serving systems where shared KV-cache blocks (e.g., vLLM's Prefix Caching) are susceptible to adversarial bit flips via Rowhammer on GPU DRAM. Using software fault injection, they show that 13 of 16 BF16 bit positions cause silent divergence, selective propagation, and persistent accumulation, enabling undetected damage amplification. A checksum countermeasure bounds damage to one batch with negligible overhead.

Rowhammer on GPU DRAM has enabled adversarial bit flips in model weights; shared KV-cache blocks in LLM serving systems present an analogous but previously unexamined target. In vLLM's Prefix Caching, these blocks exist as a single physical copy without integrity protection. Using software fault injection under ideal bit targeting, we characterize worst-case severity and identify three properties: (1) Silent divergence - 13 of 16 BF16 bit positions produce coherent but altered outputs, indistinguishable from legitimate responses without a clean baseline. (2) Selective propagation - only requests sharing the targeted prefix are affected. (3) Persistent accumulation - no temporal decay occurs, so cumulative damage grows linearly with subsequent requests. Together, these constitute a threat profile distinct from weight corruption: silent divergence and selective propagation enable detection evasion; persistent accumulation then proceeds unchecked, yielding damage amplification bounded only by how long the block remains cached. A checksum-based countermeasure detects any single-bit corruption at scheduling time, bounding cumulative damage to one batch independent of the block's cache lifetime, with negligible overhead. These results argue for integrity protection of prefix blocks before end-to-end exploitation is demonstrated.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes