Public-coin zero-knowledge arguments with (almost) minimal time and space overheads

DOI10.1007/978-3-030-64378-2_7zbMath1485.94060OpenAlexW3116737310MaRDI QIDQ2119043

Ron D. Rothblum, Alexander R. Block, Justin Holmgren, Alon Rosen, Pratik Soni

Publication date: 23 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-64378-2_7

zbMATH Keywords

random oracle modelzero-knowledge protocols

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (9)

Sumcheck arguments and their applications ⋮ Time- and space-efficient arguments from groups of unknown order ⋮ Gemini: elastic SNARKs for diverse environments ⋮ Speed-stacking: fast sublinear zero-knowledge proofs for disjunctions ⋮ Ligero: lightweight sublinear arguments without a trusted setup ⋮ Parallelizable delegation from LWE ⋮ Lattice-based succinct arguments for NP with polylogarithmic-time verification ⋮ Faster sounder succinct arguments and \textsf{IOP}s ⋮ On black-box constructions of time and space efficient sublinear arguments from symmetric-key primitives

This page was built for publication: Public-coin zero-knowledge arguments with (almost) minimal time and space overheads