Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR21-038 | 15th March 2021 06:27

Post-Quantum Succinct Arguments

RSS-Feed




TR21-038
Authors: Alessandro Chiesa, Fermi Ma, Nicholas Spooner, Mark Zhandry
Publication: 15th March 2021 10:53
Downloads: 114
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