[Resource Topic] 2024/161: zkMatrix: Batched Short Proof for Committed Matrix Multiplication

Welcome to the resource topic for 2024/161

zkMatrix: Batched Short Proof for Committed Matrix Multiplication

Authors: Mingshu Cong, Tsz Hon Yuen, Siu Ming Yiu


Matrix multiplication is a common operation in applications like machine learning and data analytics. To demonstrate the correctness of such an operation in a privacy-preserving manner, we propose zkMatrix, a zero-knowledge proof for the multiplication of committed matrices. Among the succinct non-interactive zero-knowledge protocols that have an O(\log n) transcript size and O(\log n) verifier time, zkMatrix stands out as the first to achieve O(n^2) prover time and O(n^2) RAM usage for multiplying two n \times n matrices. Significantly, zkMatrix distinguishes itself as the first zk-SNARK protocol specifically designed for matrix multiplication. By batching multiple proofs together, each additional matrix multiplication only necessitates O(n) group operations in prover time.

ePrint: https://eprint.iacr.org/2024/161

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .