Efficient designated-verifier non-interactive zero-knowledge proofs of knowledge

DOI10.1007/978-3-319-78372-7_7zbMath1415.94415OpenAlexW2794624029MaRDI QIDQ1653085

Geoffroy Couteau, Pyrros Chaidos

Publication date: 17 July 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-78372-7_7

zbMATH Keywords

zero-knowledge proofsnon-interactive proofs

Mathematics Subject Classification ID

Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (9)

Round-Efficient Anonymous Password-Authenticated Key Exchange Protocol in the Standard Model ⋮ Zero-knowledge arguments for subverted RSA groups ⋮ I want to ride my \texttt{BICYCL} : \texttt{BICYCL} implements cryptography in class groups ⋮ Efficient NIZKs for algebraic sets ⋮ Succinct publicly-certifiable proofs. Or, can a blockchain verify a designated-verifier proof? ⋮ Multi-theorem preprocessing NIZKs from lattices ⋮ Compact designated verifier NIZKs from the CDH assumption without pairings ⋮ DVNIZK ⋮ Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages

This page was built for publication: Efficient designated-verifier non-interactive zero-knowledge proofs of knowledge