发表机构
Portland State University（波特兰州立大学）
机构由 AI 辅助整理，请以论文原文为准。AI 中文总结
本文证明量子盲不可伪造性严格强于加一不可伪造性，通过新的平滑技术相干重塑查询历史，以逆多项式损失将加一攻击者转化为盲不可伪造性攻击者。
AI 中文摘要
我们证明了量子盲不可伪造性蕴含量子加一不可伪造性，解决了文献中的一个开放问题。由于已知加一不可伪造性并不蕴含盲不可伪造性，我们的结果表明在量子环境中盲不可伪造性严格强于加一不可伪造性。该蕴含关系通过一种新的平滑技术得以证明，该技术以黑盒方式相干地重新缩放量子查询算法的查询历史。这使得我们能够将任何成功的加一攻击者转化为盲不可伪造性攻击者，且仅需逆多项式损失。我们的证明代表了概念上的转变：从早期尝试中仅仅提取有用的查询历史（我们证明这在一般情况下必然失败），转变为首先相干地重塑查询历史的干扰方式。
英文摘要
We prove that quantum blind-unforgeability implies quantum plus-one unforgeability, settling an open question in the literature. Since plus-one unforgeability is known not to imply blind-unforgeability, our result establishes that blind-unforgeability is \emph{strictly stronger} than plus-one unforgeability in the quantum setting. The implication is proven using a new \emph{smoothing} technique that coherently rescales the query histories of a quantum-query algorithm in a black-box manner. This enables us to transform any successful plus-one attacker into a blind-unforgeability attacker with only inverse-polynomial loss. Our proof represents a conceptual shift from merely extracting a useful query history as in earlier attempts, which we show inevitably fails in general, to first coherently reshaping how query histories interfere.
