Cryptology ePrint Archive: Report 2019/1279

Postquantum Zero Knowledge in Constant Rounds

Nir Bitansky and Omri Shmueli

Abstract: We construct the first 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 the first constant-round zero-knowledge quantum argument for QMA.

At the heart of our protocol is a new no-cloning non-black-box simulation technique.

Category / Keywords: cryptographic protocols / quantum cryptography, zero knowledge

Date: received 4 Nov 2019, last revised 5 Nov 2019

Contact author: omrishmueli at mail tau ac il,nirbitan@tau ac il

Available format(s): PDF | BibTeX Citation

Version: 20191105:082523 (All versions of this report)

Short URL: ia.cr/2019/1279


[ Cryptology ePrint archive ]