Rachel Zhang: SNARGs for Bounded Depth Computations

Abstract: The Fiat-Shamir heuristic allows one to make interactive protocols non-interactive by replacing the verifier with hash functions. In this talk, we discuss a recent construction of succinct, non-interactive arguments for bounded depth computations, assuming sub-exponential LWE, obtained by applying the Fiat-Shamir transformation to the GKR protocol. The hash functions used combine a previous construction of correlation intractable hash functions with lossy hash functions. Based on joint work with Ruta Jawale, Yael Tauman Kalai, and Dakshita Khurana. https://eprint.iacr.org/2020/980.pdf