scientific article; zbMATH DE number 7650353

DOI10.4230/LIPIcs.ITCS.2020.5MaRDI QIDQ5875697

Lior Goldberg, Swastik Kopparty, Eli Ben-Sasson, Shubhangi Saraf

Publication date: 3 February 2023

Full work available at URL: https://arxiv.org/abs/1903.12243

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

low degree testinginteractive oracle proofs of proximitySTARK

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (10)

Time- and space-efficient arguments from groups of unknown order ⋮ High-threshold AVSS with optimal communication complexity ⋮ A PCP theorem for interactive proofs and applications ⋮ On interactive oracle proofs for Boolean R1CS statements ⋮ Speed-stacking: fast sublinear zero-knowledge proofs for disjunctions ⋮ Ligero: lightweight sublinear arguments without a trusted setup ⋮ Scalable and transparent proofs over all large fields, via elliptic curves. ECFFT. II ⋮ \textsf{Bingo}: adaptivity and asynchrony in verifiable secret sharing and distributed key generation ⋮ Efficient multivariate low-degree tests via interactive oracle proofs of proximity for polynomial codes ⋮ \textsc{Fractal}: post-quantum and transparent recursive proofs from holography

This page was built for publication: