- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper presents KVRecover, an attack that enables cross-LLM prompt reconstruction from KV cache entries. For a given source–reciever pair, KVRecover trains a small “converter” model that transforms KV cache entries of the source model into semantically similar KV cache entries of the receiver model that can then be used to reconstruct the prompt that produced the source model’s original KV cache entries. The paper evaluates KVRecover across several model pairs and datasets, showing it is generally effective at recovering semantically similar prompts, even when model sizes differ substantially.
Critical strengths
- KVRecover appears generally effective at recovering text that is semantically similar to the original prompts, with BERTScores ranging from 0.679 to 0.962. It also significantly outperforms the baseline adaptation of C2C.
Critical weaknesses
-
The threat model and motivation are not convincing. The motivation of KVRecover is that using the source model to reconstruct prompts is infeasible due to its high GPU memory consumption. The paper’s solution is to first train a small model that converts KV cache entries of the source model to the smaller receiver model. However, training such a model requires hosting the source model, meaning that step requires no less memory than just using the source model to reconstruct prompts. While the paper attempts to alleviate this in its threat model by saying a third (non-attacker) party could train and release these converters, it seems like an unlikely practice, and the paper does not argue for why it would be feasible. Furthermore, if a third party capable of hosting the source model did exist, it seems a more enticing alternative would be to simply release a model that maps source KV cache prefixes to prompts directly, rather than an arbitrary receiver model.
-
Several design decisions in the method are not well-motivated. While the method seems reasonably constructed, it reads as purely a list of what was done without any justifications. For instance, why do shallow layers use affine maps while deeper layers use residual MLPs? Why are there three progressive training stages that freeze different components and utilize different training objectives? Overall, it is difficult to understand what problems this method is overcoming and if the solution is well-justified. Additionally, Sec. 5.4 shows that stage three substantially harms semantic recovery while only marginally improving the exact match rate, calling into question its inclusion in the main method.
Questions for authors
-
Is it practical to assume that third-party developers would publish KV cache conversion models with the sole purpose of facilitating prompt reconstruction? Why not simply publish models mapping KV cache entries to prompts?
-
What is the motivation and reasoning behind the method’s core technical components, such as the depth-dependent projection and progressive training stages? Furthermore, as it seems semantic similarity is more practically useful to an attacker than preserving an already low exact match rate, why include stage 3 in the main method?
-
Given exact matches are rare, what types of information is lost during prompt reconstruction? In particular, are PII (something an attacker may have motivation to extract) generally preserved or is it mainly high-level concepts and topics?