You are looking at a specific version 20191105:082523 of this paper.
See the latest version.
Paper 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.
Metadata
- Available format(s)
- Category
- Cryptographic protocols
- Publication info
- Preprint.
- Keywords
- quantum cryptographyzero knowledge
- Contact author(s)
- omrishmueli @ mail tau ac il,nirbitan @ tau ac il
- History
- 2020-04-20: last of 3 revisions
- 2019-11-05: received
- See all versions
- Short URL
- https://ia.cr/2019/1279
- License
-
CC BY