Efficient Batched and Non-Batched Disjunctions in Linear-Homomorphic Commit-and-Prove ZK
Yibin Yang
Abstract:
Zero-Knowledge Proofs (ZKPs) allow a prover P to demonstrate to a verifier V the validity of a given statement while revealing nothing beyond. Traditionally, the ZKP statement is expressed as a circuit or a constraint system. These representations discard many valuable structures that can be exploited to improve efficiency. The notable structures include ZK disjunctions and ZK read-write memory. In this talk, I will focus on how we can design efficient ZKP protocols targeting batched and non-batched disjunctive statements within the linear-homomorphic commit-and-prove ZK paradigm. This talk will be mainly based on the paper “Batchman and Robin: Batched and Non-batched Branching for Interactive ZK,” published at ACM CCS 2023, and several subsequent works.
Bio:
Yibin Yang is a PhD student from Georgia Tech, advised by Prof. Vladimir Kolesnikov. Yibin’s research focuses on ZKP and MPC, both theoretically and practically. Recently, Yibin has been working on pushing forward ZKP and MPC systems that can efficiently use a RAM program to describe the computation task (e.g., C/C++/Assembly). He has also been working on various problems in MPC, including fair MPC, arithmetic garblings, etc. More information about Yibin can be found at https://yibinyang.info/.