Universal SNARGs for NP from Proofs of Correctness

We give new constructions of succinct non-interactive arguments ( SNARG s) for NP in the settings of both non-adaptive and adaptive soundness. Our construction of non-adaptive SNARG is universal assuming the security of a (leveled or unleveled) fully homomorphic encryption ( FHE ) scheme as well as a batch argument ( BARG ) scheme. Specifically, for any choice of parameters ℓ and L , we construct a candidate SNARG scheme for any NP language L with the following properties: (i) the proof length is ℓ· poly (λ), (ii) the common reference string crs has length L · poly (λ), and (iii) the setup is transparent (no private randomness). We prove that this SNARG has non-adaptive soundness assuming the existence of any SNARG where the proof size is ℓ, the crs size is L , and there is a size L Extended Frege ( EF ) proof of completeness for the SNARG . Moreover, we can relax the underlying SNARG to be any 2-message privately verifiable argument where the first message is of length L and the second message is of length ℓ. This yields new SNARG constructions based on any “ EF -friendly” designated-verifier SNARG or witness encryption scheme. We emphasize that our SNARG is universal in the sense that it does not depend on the argument system. We show several new implications of this construction that do not reference proof complexity: (1) a non-adaptive SNARG for NP with transparent crs from LWE under the evasive LWE heuristic. This gives a candidate lattice-based SNARG for NP . (2) a non-adaptive SNARG for NP with transparent crs assuming the (non-explicit) existence of any iO and LWE . (3) a non-adaptive SNARG for NP with a short and transparent (i.e., uniform) crs assuming LWE , FHE and the (non-explicit) existence of any hash function that makes Micali’s SNARG construction sound. (4) a non-adaptive SNARG for languages such as QR and DCR assuming only LWE . In the setting of adaptive soundness, we show how to convert any designated verifier SNARG into publicly verifiable SNARG , assuming the underlying designated verifier SNARG has an EF proof of completeness. As a corollary, we construct an adaptive SNARG for UP with a transparent crs assuming subexponential LWE under the evasive LWE heuristic. We prove our results by extending the encrypt-hash-and- BARG paradigm of [Jin-Kalai-Lombardi-Vaikuntanathan, STOC ’24].

Authors

• Zhengzhong Jin
• Yael Tauman Kalai
• Alex Lombardi
• Surya Mathialagan

Keywords

• Delegation of Computation
• Propositional Proof Complexity
• SNARGs