Polynomial IOPs for linear algebra relations

DOI10.1007/978-3-030-97121-2_19MaRDI QIDQ5087271zbMATH OpenOpenAlexFDO

Authors Alan Szepieniec, Yuncong Zhang

Publication date 8 July 2022

Published in Public-Key Cryptography – PKC 2022 (Search for Journal in Brave)

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

zbMATH Keywords

zero-knowledgeSNARKpolynomial IOPsuccinct verification

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Theory of compilers and interpreters (68N20)

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

(4)

• From polynomial IOP and commitments to non-malleable zkSNARKs
• Public-coin, complexity-preserving, succinct arguments of knowledge for NP from collision-resistance
• Polynomial IOPs for linear algebra relations
• Polynomial IOPs for memory consistency checks in zero-knowledge virtual machines

Describes a project that uses

Uses Software

• Ligero
• libiop
• Marlin

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)