Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Explore a 44-minute lecture on constructing SNARGs for Batch-NP and P using the sub-exponential Decisional Diffie Hellman (DDH) assumption. Delve into Zhengzhong Jin's presentation at the Simons Institute, which introduces novel schemes achieving poly-logarithmic proof sizes. Discover a new construction of correlation-intractable hash functions for "small input" product relations verifiable in TC^0, based on sub-exponential DDH. Learn about the minimal complexity assumptions for cryptography and gain insights from this collaborative work with Arka Rai Choudhuri, Sanjam Garg, Abhishek Jain, and Jiaheng Zhang.
