Strong Batching for Non-Interactive Statistical Zero-Knowledge

ePrint Report: Strong Batching for Non-Interactive Statistical Zero-Knowledge

Changrui Mu, Shafik Nassar, Ron D. Rothblum, Prashant Nalini Vasudevan

A zero-knowledge proof enables a prover to convince a verifier that $x \in S$, without revealing anything beyond this fact. By running a zero-knowledge proof $k$ times, it is possible to prove (still in zero-knowledge) that $k$ separate instances $x_1,\dots,x_k$ are all in $S$. However, this increases the communication by a factor of $k$. Can one do better? In other words, is …

batching beyond eprint report fact knowledge non proof prove report ron running