Reusable Designated-Verifier NIZKs for all NP from CDH

ADVANCES IN CRYPTOLOGY - EUROCRYPT 2019, PT II, pp. 593-621, 2019.

Cited by: 12|Bibtex|Views44|DOI:https://doi.org/10.1007/978-3-030-17656-3_21
EI
Other Links: dblp.uni-trier.de|academic.microsoft.com

Abstract:

Non-interactive zero-knowledge proofs (NIZKs) are a fundamental cryptographic primitive. Despite a long history of research, we only know how to construct NIZKs under a few select assumptions, such as the hardness of factoring or using bilinear maps. Notably, there are no known constructions based on either the computational or decisional...More

Code:

Data:

Your rating :
0

 

Tags
Comments