You are looking at a specific version 20210317:142425 of this paper. See the latest version.

Paper 2021/334

Post-Quantum Succinct Arguments

Alessandro Chiesa and Fermi Ma and 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). At the heart of our proof is a new "measure-and-repair" quantum rewinding procedure that achieves asymptotically optimal knowledge error.

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
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.