arXiv · 2610.00517
Blind Unforgeability implies Plus-One Unforgeability
Abstract
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Mehil Agarwal, Calliope S. Reimann, Fang Song. 2026-09-30. Blind Unforgeability implies Plus-One Unforgeability. https://searcharxiv.com/abs/2610.00517
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.