Quantum Rewinding for IOP-Based Succinct Arguments
Abstract
We analyze the post-quantum security of succinct interactive arguments constructed from interactive oracle proofs (IOPs) and vector commitment schemes. We prove that an interactive variant of the BCS transformation is secure in the standard model against quantum adversaries when the vector commitment scheme is collapsing. Our proof builds on and extends prior work on the post-quantum security of Kilians succinct interactive argument, which is instead based on probabilistically checkable proofs (PCPs). We introduce a new quantum rewinding strategy that works across any number of rounds. As a consequence of our results, we obtain standard-model post-quantum secure succinct arguments with the best asymptotic complexity known.
Keywords
Cite
@article{arxiv.2411.05360,
title = {Quantum Rewinding for IOP-Based Succinct Arguments},
author = {Alessandro Chiesa and Marcel Dall Agnol and Zijing Di and Ziyi Guan and Nicholas Spooner},
journal= {arXiv preprint arXiv:2411.05360},
year = {2025}
}
Comments
There is a mistake in the proof of Lemma 3.2, on page 15. In Step 4 of A_VC, the adversary sends Q_u determined by all verifier randomnesses, but it only has the first l-1 verifier randomnesses. A_VC must either (i) measure all verifier registers, or (ii) output the Q_u in superposition. The first one introduces more disturbance and the second is incompatible with collapsing definition