Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Revision(s):

Revision #1 to TR21-038 | 3rd June 2021 23:31

Post-Quantum Succinct Arguments: Breaking the Quantum Rewinding Barrier

RSS-Feed




Revision #1
Authors: Alessandro Chiesa, Fermi Ma, Nicholas Spooner, Mark Zhandry
Accepted on: 3rd June 2021 23:31
Downloads: 197
Keywords: 


Abstract:

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). This yields the first post-quantum succinct argument system from any falsifiable assumption.

At the heart of our proof is a new quantum rewinding procedure that enables a reduction to repeatedly query a quantum adversary for accepting transcripts as many times as desired. Prior techniques were limited to a constant number of accepting transcripts.



Changes to previous version:

new title, more general techniques, new "sequentially-repeated quantum games" framework.


Paper:

TR21-038 | 15th March 2021 06:27

Post-Quantum Succinct Arguments





TR21-038
Authors: Alessandro Chiesa, Fermi Ma, Nicholas Spooner, Mark Zhandry
Publication: 15th March 2021 10:53
Downloads: 348
Keywords: 


Abstract:

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 new "measure-and-repair" quantum rewinding procedure that achieves asymptotically optimal knowledge error.



ISSN 1433-8092 | Imprint