Abstract

Abstract: In this talk we present an overview of two recent works where we construct:

- succinct non-interactive arguments (SNARGs) for polynomial-time computation; and
- non-interactive batch arguments (BARGs) for NP.

Our constructions rely on standard hardness assumptions.

This is joint work with Abhishek Jain and Zhengzhong Jin.

Attachment