Polynomial IOPs for linear algebra relations
From MaRDI portal
(Redirected from Publication:5087271)
Recommendations
- Linear-size constant-query IOPs for delegating computation
- Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier
- Aurora: transparent succinct arguments for R1CS
- On interactive oracle proofs for Boolean R1CS statements
- Interactive oracle proofs with constant rate and query complexity
Cites work
- scientific article; zbMATH DE number 708820 (Why is no real title available?)
- Aurora: transparent succinct arguments for R1CS
- Constant-Size Commitments to Polynomials and Their Applications
- Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- Polynomial IOPs for linear algebra relations
- Scalable zero knowledge with no trusted setup
- The knowledge complexity of interactive proof-systems
- Transparent SNARKs from DARK compilers
Cited in
(6)- Commit-and-prove system for vectors and applications to threshold signing
- Polynomial IOPs for memory consistency checks in zero-knowledge virtual machines
- From polynomial IOP and commitments to non-malleable zkSNARKs
- Polynomial IOPs for linear algebra relations
- RoK and Roll -- verifier-efficient random projection for \(\tilde{O}(\lambda )\)-size lattice arguments (extended abstract)
- Public-coin, complexity-preserving, succinct arguments of knowledge for NP from collision-resistance
This page was built for publication: Polynomial IOPs for linear algebra relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5087271)
