Multi-theorem preprocessing NIZKs from lattices
From MaRDI portal
Publication:5916239
DOI10.1007/978-3-319-96881-0_25zbMath1436.94075OpenAlexW2799069235MaRDI QIDQ5916239
No author found.
Publication date: 26 September 2018
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-96881-0_25
Related Items (13)
On Black-Box Extensions of Non-interactive Zero-Knowledge Arguments, and Signatures Directly from Simulation Soundness ⋮ Dual-mode NIZKs: possibility and impossibility results for property transfer ⋮ Toward non-interactive zero-knowledge proofs for NP from LWE ⋮ Fully homomorphic NIZK and NIWI proofs ⋮ A generic transform from multi-round interactive proof to NIZK ⋮ NIZK from SNARGs ⋮ Direct computation of branching programs and its applications to more efficient lattice-based cryptography ⋮ On the complexity of compressing obfuscation ⋮ Multi-theorem preprocessing NIZKs from lattices ⋮ Compact designated verifier NIZKs from the CDH assumption without pairings ⋮ Compact NIZKs from standard assumptions on bilinear maps ⋮ New constructions of statistical NIZKs: dual-mode DV-NIZKs and more ⋮ New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust
This page was built for publication: Multi-theorem preprocessing NIZKs from lattices
