Workshops

Fall 2019

Probabilistically Checkable and Interactive Proof Systems

Sep 23, 2019 to Sep 27, 2019

Return to event »

Monday, September 23rd, 2019
9:00 am–9:20 am		Coffee and Check-In
9:20 am–9:30 am		Opening Remarks
9:30 am–10:30 am		Efficient Zero-Knowledge Proofs: A Modular Approach Yuval Ishai (Technion)
10:30 am–11:00 am		Break
11:00 am–12:00 pm		Practical Proof Systems: Implementations, Applications, and Next Steps Riad Wahby (Stanford University)
12:00 pm–2:00 pm		Lunch
2:00 pm–2:30 pm		Sonic: zk-SNARKs from Linear Sized Universal and Updatable SRS's Mary Maller (University College London)
2:30 pm–3:00 pm		Publicly Verifiable Zero Knowledge on Blockchains Alessandra Scafuro (North Carolina State University)
3:00 pm–3:30 pm		Break
3:30 pm–4:30 pm		Finding a Nash Equilibrium is No Easier than Breaking Fiat-Shamir Guy Rothblum (Weizmann Institute)
4:30 pm–5:30 pm		Reception

Tuesday, September 24th, 2019
9:00 am–9:30 am		Coffee and Check-In
9:30 am–10:30 am		No-Signaling Proofs with O(\sqrt{log n})-Provers is in PSPACE Yael Kalai (Microsoft Research)
10:30 am–11:00 am		Break
11:00 am–12:00 pm		Efficient Post-Quantum zkSNARKs from Univariate Sumcheck Nicholas Spooner (UC Berkeley)
12:00 pm–2:00 pm		Lunch
2:00 pm–2:30 pm		Recursive Techniques for Lattice-Based Zero-Knowledge Jonathan Bootle (IBM Research- Zurich)
2:30 pm–3:00 pm		From Holography to Recursive Proofs Alessandro Chiesa (UC Berkeley)
3:00 pm–3:30 pm		Break
3:30 pm–4:00 pm		Fully Homomorphic NIZK and NIWI Proofs Prabhanjan Ananth (UC Santa Barbara)
4:00 pm–4:30 pm		On Two-Message Statistically Private Arguments Dakshita Khurana (Microsoft Research)

Wednesday, September 25th, 2019
9:00 am–9:30 am		Coffee and Check-In
9:30 am–10:15 am		Efficient Zero Knowledge Proof from Interactive Proofs Yupeng Zhang (Texas A&M University)
10:15 am–11:00 am		Transparent SNARKs from DARK Compilers Benedikt Bünz (Stanford University)
11:00 am–11:30 am		Break
11:30 am–12:00 pm		Components of Recent Universal SNARKs Ariel Gabizon (Protocol Labs)
12:00 pm–2:00 pm		Lunch
2:00 pm–2:30 pm		Improved Soundness Proving Proximity to Reed-Solomon Codes and STARKs Swastik Kopparty (Rutgers University)
2:30 pm–3:00 pm		A Tight Parallel-Repetition Theorem for Random-Terminating Interactive Arguments Iftach Haitner (Tel Aviv University)
3:00 pm–3:30 pm		Break
3:30 pm–4:30 pm		Open Problem Session

Thursday, September 26th, 2019
9:00 am–9:30 am		Coffee and Check-In
9:30 am–10:30 am		How to do Fiat-Shamir in the Standard Model Alex Lombardi (MIT)
10:30 am–11:00 am		Break
11:00 am–11:30 am		How to Delegate Computations Publicly Lisa Yang (MIT)
11:30 am–12:00 pm		Streaming Verification of Graph Computations via Graph Structure Prantar Ghosh (Dartmouth College)
12:00 pm–2:00 pm		Lunch
2:00 pm–3:00 pm		Fully Linear PCPs and their Cryptographic Applications Elette Boyle (IDC Herzliya), Henry Corrigan-Gibbs (Stanford University)
3:00 pm–3:30 pm		Break
3:30 pm–4:00 pm		Delegating Computations with (almost) Minimal Time and Space Overhead Justin Holmgren (Princeton University)

Friday, September 27th, 2019
9:00 am–9:30 am		Coffee and Check-In
9:30 am–10:30 am		On The Power of Distributed Verifiers in Interactive Proofs Eylon Yogev (Technion)
10:30 am–11:00 am		Break
11:00 am–12:00 pm		Ligero: Sublinear Arguments from MPC-in-the-head Muthu Venkitasubramaniam (University of Rochester)
12:00 pm–2:00 pm		Lunch
2:00 pm–3:00 pm		Role of Composition in low-error PCP constructions Prahladh Harsha (Tata Institute of Fundamental Research)
3:00 pm–3:45 pm		2-to-2 Games, the Grassmann Graph, and Hyper-contractivity Guy Kindler (Hebrew University of Jerusalem)