All talks are held in Pacific Time. ** Schedule subject to change.**

–
Coffee and Check-in
–
Opening Remarks
–
Tutorial on Proof Systems
Abhishek Jain (Johns Hopkins University)
–
Break
–
Correlation Intractability and SNARGs from Sub-exponential DDH
Zhengzhong Jin (MIT)
–
Constant-Round Arguments from One-Way Functions
Guy Rothblum (Apple)
–
Lunch
–
Rate-1 BARGs via fully-local SSB hash families
Lalita Devadas (MIT)
–
Non-interactive Universal Arguments
Dana Shamir (Tel Aviv University)
–
Break
–
Hard Languages in NP ∩ coNP and NIZK Proofs from Unstructured Hardness
Alexis Korb (UCLA), Amit Sahai (UCLA)
–
New Techniques for Zero-Knowledge: Leveraging Inefficient Provers to Reduce Assumptions, Interaction, and Trust *Presented Virtually
Dana Dachman-Soled (University of Maryalnd)
–
Reception
–
Coffee and Check-in
–
Cryptography and Kolmogorov Complexity: A Quick Tutorial
Yanyi Liu (Cornell University)
–
Talk By
Yanyi Liu (Cornell University)
–
Break
–
Incompressiblity and Next-Block Pseudoentropy
Iftach Haitner (Tel Aviv University)
–
Cryptographic Hardness of Correlated Sampling
Russell Impagliazzo (UC San Diego)
–
SNARGs Beyond Non-Signaling
Yael Tauman Kalai (Microsoft Research)
–
Lunch
–
Derandomization: A Quick Tutorial
Lijie Chen (MIT)
–
From Derandomization to Fiat-Shamir
Lijie Chen (MIT)
–
Break
–
Capturing One-Way Functions via NP-Hardness of Meta-Complexity
Shuichi Hirahara (National Institute of Informatics, Tokyo)
–
NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach
Hanlin Ren (University of Oxford)
–
Coffee and Check-in
–
Communication Complexity, Streaming and Computational Assumptions
Moni Naor (Weizmann Institute of Science)
–
Break
–
On the Complexity of Two-Party Differential Privacy
Noam Mazor (Tel Aviv University)
–
Fine-Grained Cryptography
Marshall Ball (NYU)
–
Lunch
–
Tutorial on obfuscation
Rachel Lin (University of Washington)
–
Break
–
Tales of Obfuscation in Bounded Arithmetic, Metacomplexity, and Differential Privacy
Rahul Ilango (MIT)
–
Mutual Empowerment Between Circuit Obfuscation and Circuit Minimization
Ilya Volkovich (Boston College)
–
Assumptions in cryptography and complexity theory
Panel Discussion ()
–
Coffee and Check-in
–
Doubly Efficient Private Information Retrieval and Fully Homomorphic RAM Computation from Ring LWE
Daniel Wichs (Northeastern University)
–
Break
–
Advisor-Verifier-Prover Games and the Hardness of Information Theoretic Cryptography *Presented Virtually
Benny Applebaum (Tel-Aviv University)
–
Batch Proofs are Statistically Hiding
Prashant Vadusevan (National University of Singapore)
–
Unclonable Polymers and Their Cryptographic Applications
Tal Malkin (Columbia University)
–
Lunch
–
New Ways to Garble Arithmetic Circuits
Rachel Lin (University of Washington)
–
Break
–
Collision-Resistance from Multi-Collision-Resistance
Ron Rothblum (Technion)
–
Geometry of Secure Computation
Hemanta Maji (Purdue University)
–
Coffee and Check-in
–
Black-Hole Radiation Decoding as a Cryptographic Assumption
Zvika Brakerski (Weizmann Institute of Science)
–
Cryptography with Certified Deletion *Presented Virtually
Dakshita Khurana (University of Illinois Urbana-Champaign)
–
Break
–
Quantum Minimalism
Mark Zhandry (NTT Research)
–
Commitments to Quantum States
Fermi Ma (Princeton University)
–
Lunch
–
On the Computational Hardness Needed for Quantum Cryptography
Ran Canetti (Boston University)
–
Quantum pseudorandomness in Algorithmica, and its implications to cryptography and complexity
Luowen Qian (Boston University)
–
Black-Box Separations in Quantum Cryptography *Presented Virtually
Mohammad Mahmoody (University of Virginia)