zkMatrix: Batched Short Proof for Committed Matrix Multiplication
zkMatrix: Batched Short Proof for Committed Matrix Multiplication
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(logn) transcript size and O(logn) 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×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.
This presentation is based on the following work: Mingshu Cong, Tsz Hon Yuen, Siu-Ming Yiu. zkMatrix: Batched Short Proof for Committed Matrix Multiplication. To appear in ASIACCS 2024.
Click the link below to join the seminar at the following time
Melbourne (AEDT) : 19 Mar 2024 11:00 AM
Japan (JST) : 19 Mar 2024 9:00 AM
China (CST) : 19 Mar 2024 8:00 AM
India (IST) : 19 Mar 2024 5:30 AM
Central Europe (CET) : 19 Mar 2024 1:00 AM
New York (EST) : 18 Mar 2024 7:00 PM
Los Angeles (PST) : 18 Mar 2024 4:00 PM
Webinar passcode: 945188 (if asked when joining the seminar)
About the speaker
Associate Professor, Monash University
Dr John Yuen is an associate professor in the Department of Software Systems & Cybersecurity at Monash University. Before joining Monash, he was an assistant professor in the Department of Computer Science at the University of Hong Kong. He also worked as a senior researcher of Shield Lab at Huawei Singapore Research Centre. He received his Ph.D. degree from the University of Wollongong in 2010.