Fully Succinct Batch Arguments for NP from Indistinguishability Obfuscation

ePrint Report: Fully Succinct Batch Arguments for NP from Indistinguishability Obfuscation

Rachit Garg, Kristin Sheridan, Brent Waters, David J. Wu

Non-interactive batch arguments for $\mathsf{NP}$ provide a way to amortize the cost of $\mathsf{NP}$ verification across multiple instances. In particular, they allow a prover to convince a verifier of multiple $\mathsf{NP}$ statements with communication that scales sublinearly in the number of instances.


In this work, we study fully succinct batch arguments for $\mathsf{NP}$ in the common reference string (CRS) model …

batch eprint report obfuscation