Probabilistically Checkable and Interactive Proof Systems

Program

Proofs, Consensus, and Decentralizing Society

Location

Calvin Lab auditorium

Date

Monday, Sept. 23 – Friday, Sept. 27, 2019

Back to calendar

9 – 9:20 a.m.

Coffee and Check-In

9:20 – 9:30 a.m.

Opening Remarks

9:30 – 10:30 a.m.

Efficient Zero-Knowledge Proofs: A Modular Approach

Yuval Ishai (Technion)

10:30 – 11 a.m.

Break

11 a.m. – 12 p.m.

Practical Proof Systems: Implementations, Applications, and Next Steps

Riad Wahby (Stanford University)

12 – 2 p.m.

Lunch

2 – 2:30 p.m.

Sonic: zk-SNARKs from Linear Sized Universal and Updatable SRS's

Mary Maller (University College London)

2:30 – 3 p.m.

Publicly Verifiable Zero Knowledge on Blockchains

Alessandra Scafuro (North Carolina State University)

3 – 3:30 p.m.

Break

3:30 – 4:30 p.m.

Finding a Nash Equilibrium is No Easier than Breaking Fiat-Shamir

Guy Rothblum (Weizmann Institute)

4:30 – 5:30 p.m.

Reception

9 – 9:30 a.m.

Coffee and Check-In

9:30 – 10:30 a.m.

No-Signaling Proofs with O(\sqrt{log n})-Provers is in PSPACE

Yael Kalai (Microsoft Research)

10:30 – 11 a.m.

Break

11 a.m. – 12 p.m.

Efficient Post-Quantum zkSNARKs from Univariate Sumcheck

Nicholas Spooner (UC Berkeley)

12 – 2 p.m.

Lunch

2 – 2:30 p.m.

Recursive Techniques for Lattice-Based Zero-Knowledge

Jonathan Bootle (IBM Research- Zurich)

2:30 – 3 p.m.

From Holography to Recursive Proofs

Alessandro Chiesa (UC Berkeley)

3 – 3:30 p.m.

Break

3:30 – 4 p.m.

Fully Homomorphic NIZK and NIWI Proofs

Prabhanjan Ananth (UC Santa Barbara)

4 – 4:30 p.m.

On Two-Message Statistically Private Arguments

Dakshita Khurana (Microsoft Research)

9 – 9:30 a.m.

Coffee and Check-In

9:30 – 10:15 a.m.

Efficient Zero Knowledge Proof from Interactive Proofs

Yupeng Zhang (Texas A&M University)

10:15 – 11 a.m.

Transparent SNARKs from DARK Compilers

Benedikt Bünz (Stanford University)

11 – 11:30 a.m.

Break

11:30 a.m. – 12 p.m.

Components of Recent Universal SNARKs

Ariel Gabizon (Protocol Labs)

12 – 2 p.m.

Lunch

2 – 2:30 p.m.

Improved Soundness Proving Proximity to Reed-Solomon Codes and STARKs

Swastik Kopparty (Rutgers University)

2:30 – 3 p.m.

A Tight Parallel-Repetition Theorem for Random-Terminating Interactive Arguments

Iftach Haitner (Tel Aviv University)

3 – 3:30 p.m.

Break

3:30 – 4:30 p.m.

Open Problem Session

9 – 9:30 a.m.

Coffee and Check-In

9:30 – 10:30 a.m.

How to do Fiat-Shamir in the Standard Model

Alex Lombardi (MIT)

10:30 – 11 a.m.

Break

11 – 11:30 a.m.

How to Delegate Computations Publicly

Lisa Yang (MIT)

11:30 a.m. – 12 p.m.

Streaming Verification of Graph Computations via Graph Structure

Prantar Ghosh (Dartmouth College)

12 – 2 p.m.

Lunch

2 – 3 p.m.

Fully Linear PCPs and their Cryptographic Applications

Elette Boyle (IDC Herzliya),
Henry Corrigan-Gibbs (Stanford University)

3 – 3:30 p.m.

Break

3:30 – 4 p.m.

Delegating Computations with (almost) Minimal Time and Space Overhead

Justin Holmgren (Princeton University)

9 – 9:30 a.m.

Coffee and Check-In

9:30 – 10:30 a.m.

On The Power of Distributed Verifiers in Interactive Proofs

Eylon Yogev (Technion)

10:30 – 11 a.m.

Break

11 a.m. – 12 p.m.

Ligero: Sublinear Arguments from MPC-in-the-head

Muthu Venkitasubramaniam (University of Rochester)

12 – 2 p.m.

Lunch

2 – 3 p.m.

Role of Composition in low-error PCP constructions

Prahladh Harsha (Tata Institute of Fundamental Research)

3 – 3:45 p.m.

2-to-2 Games, the Grassmann Graph, and Hyper-contractivity

Guy Kindler (Hebrew University of Jerusalem)