Paper 2021/334

Post-Quantum Succinct Arguments: Breaking the Quantum Rewinding Barrier

Alessandro Chiesa, Fermi Ma, Nicholas Spooner, and Mark Zhandry

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.

Metadata
Available format(s)
PDF
Category
Foundations
Publication info
Preprint. MINOR revision.
Keywords
succinct argumentspost-quantum cryptographyquantum rewinding
Contact author(s)
alexch @ berkeley edu
nspooner @ bu edu
fermima @ alum mit edu
mzhandry @ gmail com
History
2021-06-03: revised
2021-03-17: received
See all versions
Short URL
https://ia.cr/2021/334
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2021/334,
      author = {Alessandro Chiesa and Fermi Ma and Nicholas Spooner and Mark Zhandry},
      title = {Post-Quantum Succinct Arguments: Breaking the Quantum Rewinding Barrier},
      howpublished = {Cryptology ePrint Archive, Paper 2021/334},
      year = {2021},
      note = {\url{https://eprint.iacr.org/2021/334}},
      url = {https://eprint.iacr.org/2021/334}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.