Post-quantum Zero Knowledge in Constant Rounds

Nir Bitansky; Omri Shmueli

Paper 2019/1279 Original: eprint.iacr.org/2019/1279 ↗

Post-quantum Zero Knowledge in Constant Rounds

Nir Bitansky

Omri Shmueli

Abstract

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.

Metadata

Available format(s): PDF
Category: Cryptographic protocols
Publication info: Preprint.
History: 2020-04-20: last updated; 2019-11-05: published
Short URL: https://ia.cr/2019/1279
License: https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2019/1279,
      author = {Nir Bitansky and Omri Shmueli},
      title = {Post-quantum Zero Knowledge in Constant Rounds},
      howpublished = {Cryptology {ePrint} Archive, Paper 2019/1279},
      year = {2019},
      url = {https://eprint.iacr.org/2019/1279}
}