On Succinct Arguments from Ideal Hash Functions

In this talk I will overview recent progress in the theory of succinct arguments in the random oracle model (ROM). Then I will focus on a result showing that well-known constructions of zkSNARKs in the ROM, including constructions used in practice, are secure in the universal composability (UC) framework.