International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Yuncong Zhang

Publications

Year
Venue
Title
2022
PKC
Polynomial IOPs for Linear Algebra Relations 📺
Alan Szepieniec Yuncong Zhang
This paper proposes new Polynomial IOPs for arithmetic circuits. They rely on the monomial coefficient basis to represent the matrices and vectors arising from the arithmetic constraint satisfaction system, and build on new protocols for establishing the correct computation of linear algebra relations such as matrix-vector products and Hadamard products. Our protocols give rise to concrete proof systems with succinct verification when compiled down with a cryptographic compiler whose role is abstracted away in this paper. Depending only on the compiler, the resulting SNARKs are either transparent or rely on a trusted setup.

Coauthors

Alan Szepieniec (1)