Polynomial IOPs for Linear Algebra Relations

DOI10.1007/978-3-030-97121-2_19zbMath1492.94166OpenAlexW4214725026MaRDI QIDQ5087271

Yuncong Zhang, Alan Szepieniec

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

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

Related Items (1)

Polynomial IOPs for Linear Algebra Relations

Uses Software

• Ligero
• libiop
• Marlin

Cites Work

• Unnamed Item
• Transparent SNARKs from DARK compilers
• Marlin: preprocessing zkSNARKs with universal and updatable SRS
• Aurora: transparent succinct arguments for R1CS
• Scalable zero knowledge with no trusted setup
• Constant-Size Commitments to Polynomials and Their Applications
• The knowledge complexity of interactive proof-systems
• Polynomial IOPs for Linear Algebra Relations
• Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting

This page was built for publication: Polynomial IOPs for Linear Algebra Relations