All talks listed in Pacific Time. Schedule subject to change.

–
Coffee and Check In
–
Opening Remarks
–
Towards iO from Polynomial Hardness

Jesko Dujmovic (CISPA)
–
Adaptively Secure Broadcast Encryption from Lattices

Rishab Goyal (UW-Madison)
–
Break
–
How to Encrypt with Random Reversible Circuits: Functional, Homomorphic and CCA-secure

Ji Luo (MIT CSAIL)
–
On Best-Possible One-Time Programs

Luowen Qian (Northeastern University)
–
Lunch (on your own)
–
Ideal Obfuscation of Arbitrary Quantum Circuits

Miryam Huang (USC/CMU)
–
Classical Obfuscation of Quantum Circuits

Aparne Gupte (MIT)
–
Break
–
Next Steps for iO, and Exploring New Algorithmic Foundations for Cryptography

Amit Sahai (UCLA)
–
Reception
–
Coffee and Check In
–
What makes a Cryptographic Assumption a Quantum Assumption?

Dakshita Khurana (NTT Research and University of Illinois Urbana-Champaign)
–
Break
–
Recent Advances in Quantum Cryptography and Applications

Omri Shmueli (NTT Research)
–
Lunch (on your own)
–
On the Cryptographic Foundations of Interactive Quantum Advantage

Kabir Tomer (University of Illinois Urbana-Champaign)
–
Quantum Lazy Sampling and Path Recording for Any Group

Barak Nehoran (Columbia University)
–
Break
–
Unclonable Encryption in the Haar Random Oracle Model

Eli Goldin (NYU)
–
Explicit Separations for One-Query Unitary Synthesis

Fangqi Dong (Princeton University)
–
Encrypting to a Mathematical Fact | Theoretically Speaking
–
Coffee and Check In
–
A Survey of Recent Advances in Doubly Efficient Interactive Proofs, with a Glimpse of SNARGs

Yael Tauman Kalai (MIT)
–
Break
–
Cryptography from Unprovability Assumptions

Surya Mathialagan
–
Mergeable Arguments

Omer Paneth (Tel-Aviv University)
–
Lunch (on your own)
–
Minimal Assumptions for Proof Systems

Iftach Haitner (Stellar Development Foundation & Tel Aviv University),
Noam Mazor (Tel Aviv University)
–
Break
–
Time-Space Tradeoffs for Probabilistic Proofs

Nick Spooner (Cornell University)
–
The Quest for Optimal IOPs

Pratyush Mishra (University of Pennsylvania)
–
Composition Theorems for Zero-Knowledge IOPs

Mor Weiss (Bar-Ilan University)
–
Coffee and Check In
–
Recent Advances in Succinct Garbling

George Lu (UT Austin)
–
Break
–
Time-Space Tradeoffs for PIR and PIR for Time-Space Tradeoffs

Alexandra Henzinger (MIT),
Seyoon Ragavan (MIT)
–
Lunch (on your own)
–
Recent Advances in PSI

Peihan Miao (Brown University)
–
Weighted Cryptography with Weight-Independent Complexity

Aarushi Goel (Rutgers University)
–
Break
–
Pseudorandom Codes

Miranda Christ (Columbia University)
–
Coffee and Check In
–
Subspace Designs and Proximity Gaps

Venkatesan Guruswami (Simons Institute, UC Berkeley)
–
Decentralized Mechanism Design

Elaine Shi (Carnegie Mellon University)
–
Break
–
A Cryptographic Lens on the Johnson-Lindenstrauss Lemma

Neekon Vafa (MIT)
–
Verifiable Delay Permutations

Mark Zhandry (Stanford University)
–
Lunch (on your own)
–
Secure Group Messaging

Yevgeniy Dodis (NYU)
–
Codes for Computationally-Bounded Channels

Jad Silbak (MIT)
–
Break
–
Panel Discussion: Cryptography and AI