Post Quantum Succinct Arguments: Breaking the Quantum Rewinding Barrier

Nicholas Spooner, Boston University

We prove that Kilian’s four-message succinct argument system is post-quantum secure in the standard model when instantiated with any probabilistically checkable proof and any collapsing hash function (which in turn exist based on the post-quantum hardness of Learning with Errors).

At the heart of our proof is a general-purpose quantum rewinding procedure that enables a reduction to repeatedly query a quantum adversary for accepting transcripts as many times as desired.

Recording of the talk