Noninteractive Zero Knowledge for NP from (Plain) Learning with Errors

Sina Shiehian
Sina Shiehian

ADVANCES IN CRYPTOLOGY - CRYPTO 2019, PT 1, pp. 89-114, 2019.

Cited by: 41|Bibtex|Views45|Links
EI

Abstract:

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

Code:

Data:

Your rating :
0

 

Tags
Comments