Towards SNARGs for NP from Standard Assumptions

Learn how to construct SNARGs (Succinct Non-interactive Arguments) for NP from standard cryptographic assumptions without relying on indistinguishability obfuscation in this technical conference talk by Zhengzhong Jin from MIT at the Simons Institute. Explore recent progress in building SNARGs for NP using witness encryption or designated-verifier SNARGs that have polynomial-size proofs of correctness in propositional logic, assuming learning with errors. Discover the theoretical foundations and practical implications of these cryptographic constructions that advance the field of proof systems. Examine the collaborative research findings developed with Yael Tauman Kalai, Alex Lombardi, Surya Mathialagan, and Vinod Vaikuntanathan, focusing on how these new approaches avoid the complexity of indistinguishability obfuscation while maintaining the desired security properties for non-interactive argument systems.