Proofs

Program

Cryptography 10 Years Later: Obfuscation, Proof Systems, and Secure Computation

Location

Calvin Lab auditorium

Date

Monday, July 14 – Friday, July 18, 2025

Back to calendar

9 – 9:30 a.m.

Coffee and Check-In

9:30 – 10:30 a.m.

An Introduction to Commitment-Based Succinct Arguments

Alessandro Chiesa (EPFL)

10:30 – 11 a.m.

Break

11 a.m. – 12 p.m.

Fiat-Shamir in the standard model: Current state-of-the-art and future challenges

Alex Lombardi (Princeton University)

12 – 2 p.m.

Lunch

2 – 3 p.m.

Functional Commitments

Pratyush Mishra (University of Pennsylvania)

3 – 3:30 p.m.

Break

3:30 – 4:30 p.m.

Incremental proof systems

Benedikt Bünz (New York University)

4:30 – 5:30 p.m.

Reception

9 – 9:30 a.m.

Coffee and Check-In

9:30 – 10:30 a.m.

Error-Correcting Codes That Enable Efficient SNARKs

Hadas Zeilberger (Yale University)

10:30 – 11 a.m.

Break

11 a.m. – 12 p.m.

SP1 Hypercube and the Jagged PCS

Ron Rothblum (Succinct)

12 – 1:30 p.m.

Lunch (on your own)

1:30 – 2:30 p.m.

SNARGs for P/poly from SIS

Hoeteck Wee (NTT Research)

2:30 – 3:30 p.m.

A New Approach for Non-Interactive Zero-Knowledge from Learning with Errors

Brent Waters (UT Austin and NTT Research)

3:30 – 4 p.m.

Break

4 – 5 p.m.

A Zero-Knowledge PCP Theorem

Nicholas Spooner (Cornell University)

9 – 9:30 a.m.

Coffee and Check-In

9:30 – 10:30 a.m.

Towards a White-Box Secure Fiat-Shamir Transformation

Gal Arnon (Simons Institute)

10:30 – 11 a.m.

Break

11 a.m. – 12 p.m.

Batch Arguments and Their Applications

Omer Paneth (Tel-Aviv University)

12 – 2 p.m.

Lunch (on your own)

2 – 3 p.m.

Towards SNARGs for NP from Standard Assumptions

Zhengzhong Jin (MIT)

3 – 3:30 p.m.

Break

3:30 – 4:30 p.m.

Succinct Non-interactive Arguments of Proximity

Daniel Wichs (Northeastern University)

9 – 9:30 a.m.

Coffee and Check-In

9:30 – 10:30 a.m.

Incrementally Verifiable Computation for NP from Standard Assumptions

Surya Mathialagan (MIT)

10:30 – 11 a.m.

Break

11 a.m. – 12 p.m.

Tree PCPs

Tamer Mour (Bocconi University)

12 – 2 p.m.

Lunch (on your own)

2 – 3 p.m.

An introduction to lattice-based folding schemes

Binyi Chen (Stanford University)

3 – 3:30 p.m.

Break

3:30 – 4:30 p.m.

Hash-based Folding Schemes

William Wang (NYU)

9 – 9:30 a.m.

Coffee and Check-In

9:30 – 10:30 a.m.

Verifiable Data Science via Interactive Proofs: What's Possible and What Isn't

Guy Rothblum (Apple)

10:30 – 11 a.m.

Break

11 – 11:30 a.m.

Accountable AI with ZKPs: Certifying Fairness and Explanations under model Confidentiality

Chhavi Yadav (CMU)

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

VerITAS: Verifying Image Transformations at Scale

Trisha Datta (Stanford University)

12 – 2 p.m.

Lunch (on your own)

2 – 3 p.m.

Twist and Shout: Fast, Simple Memory Arguments

Justin Thaler (Georgetown University)

3 – 3:30 p.m.

Break

3:30 – 4:30 p.m.

Collaborative zk-SNARKs: Proving as One over Distributed Secrets

Aarushi Goel (Purdue University)