Towards SNARGs for NP from Standard Assumptions

I’ll present recent progress towards constructing SNARGs for NP from standard cryptographic assumptions, without relying on indistinguishability obfuscation (iO). Specifically, we show how to build SNARGs for NP from witness encryption or designated-verifier SNARGs that have a polynomial-size proof of correctness in propositional logic, assuming learning with errors.

Based on joint works with Yael Tauman Kalai, Alex Lombardi, Surya Mathialagan, and Vinod Vaikuntanathan.