New Constructions of Reusable Designated-Verifier NIZKs

Alex Lombardi
Alex Lombardi
Willy Quach
Willy Quach

ADVANCES IN CRYPTOLOGY - CRYPTO 2019, PT III, pp. 670-700, 2019.

Cited by: 14|Bibtex|Views49|DOI:https://doi.org/10.1007/978-3-030-26954-8_22
EI
Other Links: academic.microsoft.com|dblp.uni-trier.de

Abstract:

Non-interactive zero-knowledge arguments (NIZKs) for NP are an important cryptographic primitive, but we currently only have instantiations under a few specific assumptions. Notably, we are missing constructions from the learning with errors (LWE) assumption, the Diffie-Hellman (CDH/DDH) assumption, and the learning parity with noise (LPN...More

Code:

Data:

Your rating :
0

 

Tags
Comments