YoVDO

Correlation Intractability and SNARGs from Sub-exponential DDH

Offered By: Simons Institute via YouTube

Tags

Cryptography Courses Complexity Theory Courses

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

Applied Cryptography
University of Virginia via Udacity Cryptography II
Stanford University via Coursera Coding the Matrix: Linear Algebra through Computer Science Applications
Brown University via Coursera Cryptography I
Stanford University via Coursera Unpredictable? Randomness, Chance and Free Will
National University of Singapore via Coursera