Non-Interactive Batch Arguments for NP from Standard Assumptions

We study the problem of designing non-interactive batch arguments for NP. Such an argument system allows an ecient prover to prove multiple NP statements, with size smaller than the combined witness length. We provide the €rst construction of such an argument system for NP in the common reference string model based on standard cryptographic assumptions. Prior works either require non-standard assumptions (or the random oracle model) or can only support private veri€cation. At the heart of our result is a new dual mode interactive batch argument system for NP. We show how to apply the correlation-intractability framework for Fiat-Shamir – that has primarily been applied to proof systems – to such interactive arguments.