A sequence of recent works, concluding with Mu et al. (Eurocrypt, 2024) has shown that every problem \Pi admitting a non-interactive statistical zero-knowledge proof (NISZK) has an efficient zero-knowledge batch verification protocol. Namely, an NISZK protocol for proving that x_1,\dots,x_k \in \Pi with communication that only scales poly-logarithmically with k. ... more >>>