Noninteractive Zero Knowledge for NP from (Plain) Learning with Errors
ADVANCES IN CRYPTOLOGY - CRYPTO 2019, PT 1, pp. 89-114, 2019.
We finally close the long-standing problem of constructing a noninteractive zero-knowledge (NIZK) proof system for any NP language with security based on the plain Learning With Errors (LWE) problem, and thereby on worst-case lattice problems. Our proof system instantiates the framework recently developed by Canetti et al. [EUROCRYPT'18],...More
Full Text (Upload PDF)
PPT (Upload PPT)