[Resource Topic] 2019/1279: Post-quantum Zero Knowledge in Constant Rounds

Welcome to the resource topic for 2019/1279

Post-quantum Zero Knowledge in Constant Rounds

Authors: Nir Bitansky, Omri Shmueli


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.

ePrint: https://eprint.iacr.org/2019/1279

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .