YoVDO

Hard Languages in NP ∩ coNP and NIZK Proofs from Unstructured Hardness

Offered By: Simons Institute via YouTube

Tags

Complexity Theory Courses Cryptography Courses Theoretical Computer Science Courses Non-Interactive Zero-Knowledge Proofs Courses

Course Description

Overview

Explore a 49-minute lecture on the existence of unstructured hard languages in NP ∩ coNP and the construction of non-interactive zero-knowledge (NIZK) proofs. Delve into the first evidence supporting the existence of these languages, addressing Bennett and Gill's long-standing question about P separation from NP ∩ coNP relative to a random oracle. Examine the conditional separation based on UP not being contained in RP, and discover how this relates to injective one-way functions. Learn about a novel NIZK proof construction for NP with a uniformly random reference string, derived from a special type of hash function implied by an unstructured random oracle. Gain insights from speakers Amit Sahai and Alexis Korb from UCLA as they present their findings on minimal complexity assumptions for cryptography at the Simons Institute.

Syllabus

Hard Languages in NP ∩ coNP and NIZK Proofs from Unstructured Hardness


Taught by

Simons Institute

Related Courses

Advanced Data Structures in Java
University of California, San Diego via Coursera
离散数学
Shanghai Jiao Tong University via Coursera
The Beauty and Joy of Computing - AP® CS Principles Part 2
University of California, Berkeley via edX
Transforming Development: The Science and Practice of Resilience Thinking
SDG Academy via Independent
The Next Generation of Infrastructure
Delft University of Technology via edX