Lattice-based zero-knowledge SNARGs for arithmetic circuits
From MaRDI portal
Publication:2284114
DOI10.1007/978-3-030-30530-7_11zbMath1453.94109OpenAlexW2972929169MaRDI QIDQ2284114
Publication date: 14 January 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-30530-7_11
Related Items (3)
Lattice-based succinct arguments for NP with polylogarithmic-time verification ⋮ Lower bound on SNARGs in the random oracle model ⋮ A non-PCP approach to succinct quantum-safe zero-knowledge
This page was built for publication: Lattice-based zero-knowledge SNARGs for arithmetic circuits