International Association for Cryptologic Research

International Association
for Cryptologic Research


Paper: Public-Coin Statistical Zero-Knowledge Batch Verification against Malicious Verifiers

Inbar Kaslasi , Technion
Ron D. Rothblum , Technion
Prashant Nalini Vasudevan , UC Berkeley
DOI: 10.1007/978-3-030-77883-5_8 (login may be required)
Search ePrint
Search Google
Conference: EUROCRYPT 2021
Abstract: Suppose that a problem $\Pi$ has a statistical zero-knowledge (SZK) proof with communication complexity $m$. The question of batch verification for SZK asks whether one can prove that $k$ instances $x_1,\dots,x_k$ all belong to $\Pi$ with a statistical zero-knowledge proof whose communication complexity is better than $k \cdot m$ (which is the complexity of the trivial solution of executing the original protocol independently on each input). In a recent work, Kaslasi et al. (TCC, 2020) constructed such a batch verification protocol for any problem having a non-interactive SZK (NISZK) proof-system. Two drawbacks of their result are that their protocol is private-coin and is only zero-knowledge with respect to the honest verifier. In this work, we eliminate these two drawbacks by constructing a public-coin malicious-verifier SZK protocol for batch verification of NISZK. Similarly to the aforementioned prior work, the communication complexity of our protocol is $(k+poly(m)) \cdot polylog(k,m)$.
Video from EUROCRYPT 2021
  title={Public-Coin Statistical Zero-Knowledge Batch Verification against Malicious Verifiers},
  author={Inbar Kaslasi and Ron D. Rothblum and Prashant Nalini Vasudevan},