Exploring Constructions of Compact NIZKs from Various Assumptions

ADVANCES IN CRYPTOLOGY - CRYPTO 2019, PT III, pp. 639-669, 2019.

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

Abstract:

A non-interactive zero-knowledge (NIZK) protocol allows a prover to non-interactively convince a verifier of the truth of the statement without leaking any other information. In this study, we explore shorter NIZK proofs for all NP languages. Our primary interest is NIZK proofs from falsifiable pairing/pairing-free group-based assumptions...More

Code:

Data:

Your rating :
0

 

Tags
Comments