Correlation Intractability and SNARGs from Sub-exponential DDH
Offered By: Simons Institute via YouTube
Course Description
Overview
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.
Syllabus
Correlation Intractability and SNARGs from Sub-exponential DDH
Taught by
Simons Institute
Related Courses
The Next Generation of InfrastructureDelft University of Technology via edX The Beauty and Joy of Computing - AP® CS Principles Part 2
University of California, Berkeley via edX Advanced Data Structures in Java
University of California, San Diego via Coursera Theory of Computation
Indian Institute of Technology Kanpur via Swayam 离散数学
Shanghai Jiao Tong University via Coursera