On the existence of three round zero-knowledge proofs
From MaRDI portal
Publication:1653072
DOI10.1007/978-3-319-78372-7_1zbMath1415.94430OpenAlexW2794953040MaRDI QIDQ1653072
Abhishek Jain, Vipul Goyal, Nils Fleischhacker
Publication date: 17 July 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-78372-7_1
Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (9)
A black-box approach to post-quantum zero-knowledge in constant rounds ⋮ Round-optimal fully black-box zero-knowledge arguments from one-way permutations ⋮ Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round ⋮ A new approach to efficient non-malleable zero-knowledge ⋮ Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation ⋮ Individual simulations ⋮ Post-quantum resettably-sound zero knowledge ⋮ Which languages have 4-round fully black-box zero-knowledge arguments from one-way functions? ⋮ Weak Zero-Knowledge beyond the Black-Box Barrier
This page was built for publication: On the existence of three round zero-knowledge proofs
