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

summary

The gist

Bit-Flip Vulnerability of Shared KV-Cache Blocks in LLM Serving Systems is a characterization of how shared KV-cache blocks in LLM serving systems are vulnerable to adversarial bit flips…

In short

The study characterizes how shared KV-cache blocks in LLM serving systems are vulnerable to adversarial bit flips, a threat different from model weight corruption. It found three key properties: silent divergence, selective propagation, and persistent accumulation. This means small errors can accumulate over time without being easily detected by standard quality checks.

Key concepts

Silent Divergence
This occurs when a single bit flip in the BF16 data produces an output that looks coherent but is subtly altered. It is indistinguishable from a correct response unless you have a perfect baseline, allowing the corruption to bypass simple quality filters.
Selective Propagation
Corruption only affects requests that share the exact same prefix block as the targeted bit flip. This selectivity means an attacker can precisely target specific user queries or request patterns without affecting unrelated data, making detection harder.
Persistent Accumulation
Unlike other faults, these bit flips do not decay over time; they accumulate linearly with every subsequent request that uses the corrupted block. This unchecked growth allows for significant damage to build up over the cache's lifetime.

Terminology used across episodes

This episode discusses

The paper

Bit-Flip Vulnerability of Shared KV-Cache Blocks in LLM Serving Systems · Read on arXiv

Institute of Science Tokyo

DOI: 10.5220/0015138800004103

Transcript

Introduction to the show: ident: Security Radio. Generated commentary on the latest security and cryptography papers.

Nadia: I'm Nadia.

Elias: And I'm Elias, here with Priya.

Nadia: We're looking at the paper: "Bit-Flip Vulnerability of Shared KV-Cache Blocks in LLM Serving Systems".

Paper summary: Nadia: So, to recap what we've discussed so far, this paper dives into the vulnerability of shared KV-cache blocks in LLM serving systems to adversarial bit flips. The core thesis is that these shared blocks present a threat profile distinct from model weight corruption because they exhibit silent divergence and persistent accumulation.

Elias: That distinction is key; the authors characterize the worst-case severity using software fault injection under an ideal bit targeting assumption, and they identify those three properties: silent divergence, selective propagation, and persistent accumulation.

Priya: Silent divergence means that thirteen of sixteen bit positions in a BF16 format produce coherent but altered outputs that look legitimate without a clean baseline. That’s the hardest part to detect.

Nadia: Exactly. Then they show selective propagation, proving that only requests sharing the targeted prefix are affected, and finally, persistent accumulation shows no temporal decay; damage grows strictly linearly with subsequent requests that hit the same block.

Elias: The paper systematically scans all sixteen bit positions of BF16 and finds a hierarchy in impact magnitude, noting that mean token change rate generally increases from the least significant bit of the mantissa to the most significant bit of the exponent.

Priya: And they found that collapse, which is when you get overtly detectable output like NaN or infinity, was concentrated at bit fourteen. That suggests targeting those higher exponent bits could be particularly effective for causing immediate failure.

Nadia: The paper also proposes a specific lightweight countermeasure: a checksum-based integrity check applied at scheduling time that detects any single bit corruption and bounds cumulative damage to one batch independent of the block's cache lifetime.

Elias: That checksum mechanism is proposed as an orthogonal defense because it detects the corruption without sacrificing the sharing capability of the cache structure, which is what makes it different from traditional ECC approaches.

Priya: So, while hardware ECC handles single-bit errors in memory, this software check seems designed specifically to guard against silent divergence by detecting subtle changes that don't trigger hardware alarms.

Nadia: Right. The implication is that we need a mechanism like this to directly address silent divergence without slowing down the entire serving system or destroying the performance of the prefix caching layer.

Conclusion: Elias: The authors, Yuji Yamamoto and Satoshi Matsuura, have characterized a threat that moves beyond just corrupting static model weights to attacking the dynamic, shared structures of KV-cache blocks in LLM serving systems.

Nadia: They’ve shown that this vulnerability isn't just about catastrophic failure; it’s about a quiet accumulation of damage where the system keeps making small, undetectable errors with every request.

Elias: The paper establishes that silent divergence and selective propagation form a detection evasion chain, meaning an attacker can keep the damage hidden while limiting its spread to specific user requests.

Priya: For someone just listening, this means that ensuring data integrity isn't just about making sure the hardware doesn't fail entirely; it’s about implementing runtime verification checks specifically tailored to how AI models manage their shared, dynamic memory structures.

Nadia: Precisely. The authors conclude that while hardware ECC is useful for correcting single-bit errors, the checksum-based countermeasure they proposed is the only measure they found that directly addresses silent divergence without sacrificing cache effectiveness.

Elias: And they stress that this integrity protection should be considered before we close the gap between GPU virtual-to-physical address translation and any demonstrated cache detection techniques.

Priya: So, moving forward, the focus shifts to creating these runtime checks that bound cumulative damage to a single batch and ensuring those checks are robust against the kinds of targeted bit flips they characterized in this work.

More episodes

← Home