Succinct Non-Interactive Zero Knowledge
Non-interactive zero-knowledge proofs for general NP statements are a powerful cryptographic primitive. Prior theoretical work constructs zero-knowledge proofs that, asymptotically, are short and easy to verify. However, these remain too inefficient for practical use.
In this talk, I describe new techniques that significantly improve the efficiency of zero-knowledge proofs. These techniques consist of theoretical insights providing qualitative improvements, as well as novel engineering.
Based on joint works with Eli Ben-Sasson, Daniel Genkin, Eran Tromer, and Madars Virza.