Post-quantum Zero Knowledge in Constant Rounds
This addresses the need for post-quantum secure zero-knowledge proofs, which is crucial for cryptography in the quantum era, representing a novel advancement rather than an incremental improvement.
The paper tackles the problem of constructing constant-round zero-knowledge arguments for NP that are secure against quantum attacks, achieving a protocol based on Quantum Fully-Homomorphic Encryption and other primitives, with a corollary for QMA.
We construct a constant-round zero-knowledge classical argument for NP secure against quantum attacks. We assume the existence of Quantum Fully-Homomorphic Encryption and other standard primitives, known based on the Learning with Errors Assumption for quantum algorithms. As a corollary, we also obtain a constant-round zero-knowledge quantum argument for QMA. At the heart of our protocol is a new no-cloning non-black-box simulation technique.