New (and old) proof systems for lattice problems
From MaRDI portal
Publication:1753870
DOI10.1007/978-3-319-76581-5_21zbMath1420.94032OpenAlexW2792254317MaRDI QIDQ1753870
Navid Alamati, Chris Peikert, Noah Stephens-Davidowitz
Publication date: 29 May 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-76581-5_21
Related Items (5)
On Black-Box Extensions of Non-interactive Zero-Knowledge Arguments, and Signatures Directly from Simulation Soundness ⋮ Toward non-interactive zero-knowledge proofs for NP from LWE ⋮ On the smoothing parameter and last minimum of random orthogonal lattices ⋮ Multi-theorem preprocessing NIZKs from lattices ⋮ Public-coin statistical zero-knowledge batch verification against malicious verifiers
This page was built for publication: New (and old) proof systems for lattice problems
