- Rating
- 3
- Confidence
- 2
- Informativeness
- 3
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper studies security risks from malicious draft models in speculative decoding. The attack proposed in this paper, BandRider, exploits top-k verification to inject affirmative prefixes using low-probability yet sufficiently high-ranked tokens, encouraging the target model to generate harmful continuations. Its main contributions are identifying this attack channel and analyzing two necessary conditions for success, namely prefix acceptance and subsequent target-model compliance. Experiments across seven target models and multiple safety benchmarks show increased harmful compliance under top-k verification, while the tested stricter rules generally block the attacks.
Critical strengths
- The paper points out that even if the target model and the verifier are themselves trusted, security risks can still arise when a malicious draft model is used in conjunction with a top-k verification mechanism.
- The paper distinguishes commitment acceptance from downstream compliance. It evaluates both across multiple target models and verification rules, helping explain when the attack succeeds.
Critical weaknesses
- The practical applicability remains limited. The attack requires control over the draft model and a verification rule that admits the injected commitment prefix. The prefix must also induce downstream compliance, which varies substantially across target models. Although the weights-only experiment demonstrates feasibility, the paper provides limited evidence of how broadly these conditions hold in realistic deployments.
- The safety claim is broader than the evidence supports. The analysis of probability-threshold verification is conditional on rejecting a specific commitment token. It does not establish safety against alternative prefixes or adaptive malicious drafts. The results therefore support resistance to the tested attacks rather than a general safety guarantee.
Questions for authors
- Could you clarify how commonly verification rules vulnerable to BandRider are used in deployed systems? Are there examples of these rules being used with third-party draft models? This would help assess the practical relevance of the threat model.
- Is the safety claim for probability-threshold verification limited to the tested commitment prefixes, or intended to cover arbitrary malicious draft models? If the latter, how does the analysis rule out alternative prefixes that pass verification and induce downstream compliance?
3 comments
Thank you for the detailed response and the revisions. The reported speed gains help motivate relaxed verification as a plausible deployment risk, although it remains unclear how commonly vulnerable rules are used with third-party draft models in practice. I appreciate the narrower safety claim and the additional adaptive-search experiment, including the reported zero attack success rates under the tested threshold rules. However, Proposition 1 provides a conditional, token-level guarantee, and the empirical evidence against adaptive attacks remains limited to the tested settings, search objective, and budget. These results strengthen the evidence for resistance to the evaluated attacks, but do not establish a general guarantee against adaptive malicious drafts. The revisions address most of my concerns and strengthen the paper, but the remaining limitations do not justify raising my rating to a clear accept. I therefore maintain my rating of weak accept.
Thanks for the engaged discussion; scope and convergence
Thank you for the active participation throughout the discussion, and for the careful second read of the revision.
We are glad the revisions addressed most of your concerns, and we agree with your framing of the scope. Proposition 1 is a conditional, token-level guarantee, and the adaptive-search evidence covers the tested settings, search objective, and budget; the revision states exactly this. For an empirical security result, resistance to every attack we can construct, with the boundary drawn honestly, is the standard we believe a paper should meet. We appreciate that this discussion pushed the paper to state it precisely.
On the prevalence question: production serving today defaults to rejection sampling, which our results place on the immune side. The revision scopes the exposure to the relaxation trajectory rather than to any shipped system.
Thank you again for the constructive engagement.
Prevalence today, offline two-gate check, and threshold safety under rule-aware search
Thank you for the accurate summary. We answer the two weaknesses and the two questions together, since each pair concerns the same point. The changes below are already in the attached revision and marked in blue.
W1 + Q1 (practical applicability, and how common vulnerable rules are).
How common the exposure is today: the production default, rejection sampling [1] as implemented in vLLM and HF, is immune in our results, and the paper says so. The risk is the direction of travel: top-k token verification has been proposed to raise acceptance [2], AASD ships a relaxed acceptance variant [3], a 2026 survey lists the family [4], and the speed incentive is real, since relaxing sampled-exact to top-50 on our reference pair raises accepted length from 1.54 to 3.82 tokens per round and speed from 19.7 to 36.7 tok/s.
How broadly the attack's conditions hold: both are measurable offline, before any attack. Gate 1 asks whether the pivot token's rank fits inside k (the band survey, run on all seven targets); gate 2 asks whether the target continues a committed opening (measured directly). On these probes the channel opens on all seven targets (0.05 to 0.74 above each model's clean-prompt baseline), and the strongest, weights-only form replicates in a second family:
A deployment can likewise read its safe k offline before adopting any relaxation (n=100, Llama-3, anchor plan):
The two-gate recipe and these robustness results are in the revision (Secs. 5.3 and 6).
W2 + Q2 (is the threshold-safety claim prefix-limited or general?).
You are right that the claim read broader than the evidence, and we scoped it in two steps. At the rule level, Proposition 1 says a token below the rule's cutoff can never be accepted, whatever the draft does; this holds for any draft, and it is why every draft we trained or constructed stays near zero under threshold rules. At the attack level, the earlier evidence covered a fixed pool of 24 openings, and the search appendix flagged broader search as open. For this revision we ran that search: beam search per instruction, in which every proposed token must pass the rule and prefixes are scored by commitment strength.
The search commits its six-token prefixes almost fully (5.0 of 6 tokens), yet 65 of 100 outputs are refusal openers ("I cannot provide..."). The reason is structural: threshold-passing tokens are tokens the target finds likely, and the target's likely continuations of harmful requests are refusals. The target's own distribution blocks the pivot, not our search pool. The revision says "probability-threshold acceptance held every attack we construct at the floor, including a rule-aware adaptive search", states the scope of Proposition 1, and keeps the search appendix's budget disclosure (A.11).
References
[1] Leviathan et al. Fast Inference from Transformers via Speculative Decoding. ICML 2023.
[2] Huang et al. SelecTKD: Selective Token-Weighted Knowledge Distillation for LLMs. arXiv:2510.24021, 2025.
[3] Wang et al. Alignment-Augmented Speculative Decoding with Alignment Sampling and Conditional Verification. EMNLP 2025.
[4] Wang et al. Revisiting Lossy Verification in Speculative Decoding: Mechanisms, Trade-offs, and Failure Modes. arXiv:2607.26627, 2026.