@inproceedings{46486df4e2b8406393ccd0086a286c07,
title = "Post-quantum zero knowledge in constant rounds",
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.",
keywords = "Non-black-box simulation, Post-quantum cryptography, Zero-knowledge",
author = "Nir Bitansky and Omri Shmueli",
note = "Publisher Copyright: {\textcopyright} 2020 ACM.; 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020 ; Conference date: 22-06-2020 Through 26-06-2020",
year = "2020",
month = jun,
day = "8",
doi = "https://doi.org/10.1145/3357713.3384324",
language = "الإنجليزيّة",
series = "Proceedings of the Annual ACM Symposium on Theory of Computing",
pages = "269--279",
editor = "Konstantin Makarychev and Yury Makarychev and Madhur Tulsiani and Gautam Kamath and Julia Chuzhoy",
booktitle = "STOC 2020 - Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing",
}