scientific article; zbMATH DE number 7650353
From MaRDI portal
Publication:5875697
DOI10.4230/LIPICS.ITCS.2020.5MaRDI QIDQ5875697FDOQ5875697
Shubhangi Saraf, Lior Goldberg, Swastik Kopparty, Eli Ben-Sasson
Publication date: 3 February 2023
Full work available at URL: https://arxiv.org/abs/1903.12243
Title of this publication is not available (Why is that?)
Cited In (22)
- Efficient transparent polynomial commitments for zk-SNARKs
- Fiat-Shamir security of FRI and related SNARKs
- Time- and space-efficient arguments from groups of unknown order
- Distributed-prover interactive proofs
- From polynomial IOP and commitments to non-malleable zkSNARKs
- Ligero: lightweight sublinear arguments without a trusted setup
- Scalable and transparent proofs over all large fields, via elliptic curves. ECFFT. II
- On interactive oracle proofs for Boolean R1CS statements
- High-threshold AVSS with optimal communication complexity
- \textsf{Bingo}: adaptivity and asynchrony in verifiable secret sharing and distributed key generation
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
- STIR: Reed-Solomon proximity testing with fewer queries
- A PCP theorem for interactive proofs and applications
- FRIDA: data availability sampling from FRI
- On soundness notions for interactive oracle proofs
- BaseFold: efficient field-agnostic polynomial commitment schemes from foldable codes
- Field-agnostic SNARKs from expand-accumulate codes
- How to prove statements obliviously?
- On the concrete security of non-interactive FRI
- Zero-knowledge IOPs approaching witness length
- Efficient multivariate low-degree tests via interactive oracle proofs of proximity for polynomial codes
- Speed-stacking: fast sublinear zero-knowledge proofs for disjunctions
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5875697)
