–
Coffee and Check-In
–
Opening Remarks
–
Efficient Zero-Knowledge Proofs: A Modular Approach
Yuval Ishai (Technion)
–
Break
–
Practical Proof Systems: Implementations, Applications, and Next Steps
Riad Wahby (Stanford University)
–
Lunch
–
Sonic: zk-SNARKs from Linear Sized Universal and Updatable SRS's
Mary Maller (University College London)
–
Publicly Verifiable Zero Knowledge on Blockchains
Alessandra Scafuro (North Carolina State University)
–
Break
–
Finding a Nash Equilibrium is No Easier than Breaking Fiat-Shamir
Guy Rothblum (Weizmann Institute)
–
Reception
–
Coffee and Check-In
–
No-Signaling Proofs with O(\sqrt{log n})-Provers is in PSPACE
Yael Kalai (Microsoft Research)
–
Break
–
Efficient Post-Quantum zkSNARKs from Univariate Sumcheck
Nicholas Spooner (UC Berkeley)
–
Lunch
–
Recursive Techniques for Lattice-Based Zero-Knowledge
Jonathan Bootle (IBM Research- Zurich)
–
From Holography to Recursive Proofs
Alessandro Chiesa (UC Berkeley)
–
Break
–
Fully Homomorphic NIZK and NIWI Proofs
Prabhanjan Ananth (UC Santa Barbara)
–
On Two-Message Statistically Private Arguments
Dakshita Khurana (Microsoft Research)
–
Coffee and Check-In
–
Efficient Zero Knowledge Proof from Interactive Proofs
Yupeng Zhang (Texas A&M University)
–
Transparent SNARKs from DARK Compilers
Benedikt Bünz  (Stanford University)
–
Break
–
Components of Recent Universal SNARKs
Ariel Gabizon (Protocol Labs)
–
Lunch
–
Improved Soundness Proving Proximity to Reed-Solomon Codes and STARKs
Swastik Kopparty (Rutgers University)
–
A Tight Parallel-Repetition Theorem for Random-Terminating Interactive Arguments
Iftach Haitner (Tel Aviv University)
–
Break
–
Open Problem Session
–
Coffee and Check-In
–
How to do Fiat-Shamir in the Standard Model
Alex Lombardi (MIT)
–
Break
–
How to Delegate Computations Publicly
Lisa Yang (MIT)
–
Streaming Verification of Graph Computations via Graph Structure
Prantar Ghosh (Dartmouth College)
–
Lunch
–
Fully Linear PCPs and their Cryptographic Applications
Elette Boyle (IDC Herzliya), Henry Corrigan-Gibbs (Stanford University)
–
Break
–
Delegating Computations with (almost) Minimal Time and Space Overhead
Justin Holmgren (Princeton University)
–
Coffee and Check-In
–
On The Power of Distributed Verifiers in Interactive Proofs
Eylon Yogev (Technion)
–
Break
–
Ligero: Sublinear Arguments from MPC-in-the-head
Muthu Venkitasubramaniam (University of Rochester)
–
Lunch
–
Role of Composition in low-error PCP constructions
Prahladh Harsha (Tata Institute of Fundamental Research)
–
2-to-2 Games, the Grassmann Graph, and Hyper-contractivity
Guy Kindler (Hebrew University of Jerusalem)