Quantum Rewinding for IOP-Based Succinct Arguments

TL;DR

This paper proves the post-quantum security of succinct interactive arguments based on IOPs and vector commitments, introducing a new quantum rewinding technique that enhances security proofs in the standard model.

Contribution

It introduces a novel quantum rewinding strategy applicable to any number of rounds, extending security analysis to IOP-based arguments in the quantum setting.

Findings

Proves security of IOP-based succinct arguments against quantum adversaries.

Develops a new quantum rewinding method for multi-round protocols.

Achieves the best known asymptotic complexity for post-quantum secure 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.