Zero knowledge protocols from succinct constraint detection
From MaRDI portal
Publication:1690269
DOI10.1007/978-3-319-70503-3_6zbMath1416.68020OpenAlexW2765700841MaRDI QIDQ1690269
Michael Riabzev, Eli Ben-Sasson, Michael A. Forbes, Ariel Gabizon, Alessandro Chiesa, Nicholas Spooner
Publication date: 19 January 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-70503-3_6
interactive proofsprobabilistically checkable proofszero knowledgepolynomial identity testingsumcheck
Linear codes (general theory) (94B05) Cryptography (94A60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Randomized algorithms (68W20) Network protocols (68M12)
Related Items (8)
Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration ⋮ Spatial Isolation Implies Zero Knowledge Even in a Quantum World ⋮ Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier ⋮ On succinct non-interactive arguments in relativized worlds ⋮ Linear-size constant-query IOPs for delegating computation ⋮ Proof-carrying data from arithmetized random oracles ⋮ Scalable and transparent proofs over all large fields, via elliptic curves. ECFFT. II ⋮ Zero-Knowledge Proofs of Proximity
This page was built for publication: Zero knowledge protocols from succinct constraint detection
