Program
Abstracts for the talks below can be found [here].
| Sunday | ||
| 17:00-20:00 | Check-in | |
| 19:30-21:00 | Dinner | |
| Monday | ||
| 07:30-09:00 | Breakfast | |
| 09:15-9:30 | Round of introductions | |
| 09:30-10:20 | Noga Ron-Zewi | Highly-efficient Interactive Oracle Proofs & Cryptographic Applications |
| 10:20-10:50 | Coffee break | |
| 10:50-11:40 | Gal Arnon | How to convince someone who's barely listening (even to themselves) |
| 11:40-12:00 | Coffee break | |
| 12:00-12:50 | Jonathan Bootle | Elastic SNARKs for Diverse Environments |
| 13:00-14:30 | Lunch | |
| 14:30-15:20 | Shafik Nassar | Succinct Interactive Oracle Proofs: Applications and Limitations |
| 15:20-16:00 | Coffee break | |
| 16:00-16:50 | Rachel Zhang | Fiat-Shamir and SNARGs for Sum-Check |
| 19:30 | Dinner at local restaurant | |
| Tuesday | ||
| 07:30-08:45 | Breakfast | |
| 08:45-14:00 | Excursion | |
| 15:10-16:00 | Angela Robinson | The Role of ZKP in the Privacy-Preserving Analytics World |
| 16:00-16:30 | Coffee break | |
| 16:30-17:20 | Leonid Reyzin | Compact Certificates of Collective Knowledge |
| 19:30 | Dinner | |
| 21:00 | Open problems | |
| Wednesday | ||
| 07:30-09:00 | Breakfast | |
| 09:30-10:20 | Abhishek Jain | Recent advances in SNARGs from Standard Assumptions |
| 10:20-10:50 | Coffee break | |
| 10:50-11:40 | Yael Kalai | Delegating Computation: Simple at Last! |
| 11:40-12:00 | Coffee break | |
| 12:00-12:50 | Omer Paneth | Incrementally Verifiable Computation, Mergeable Delegation, and Batch Arguments |
| 13:00-14:30 | Lunch | |
| 14:30-15:20 | Mor Weiss | Your Reputation's Safe with Me: Framing-Free Distributed Zero-Knowledge Proofs |
| 15:20-16:00 | Coffee break | |
| 16:00-16:50 | Dan Carmon | Proximity gaps for Reed-Solomon codes |
| 19:30 | Dinner | |
| 21:00 | Open stage | |
| Thursday | ||
| 07:30-09:00 | Breakfast | |
| 09:30-10:20 | Irit Dinur | PCPs, LTCs, and high dim expanders |
| 10:20-10:50 | Coffee break | |
| 10:50-11:40 | Dana Moshkovitz | Tighter MA/1 Circuit Lower Bounds From Verifier Efficient PCPs for PSPACE |
| 11:40-12:00 | Coffee break | |
| 12:00-12:50 | Tal Herman | Verifying the Unseen - interactive proofs for label invariant distribution properties |
| 13:00-14:30 | Lunch | |
| 14:30-15:20 | Muthuramakrishnan Venkitasubramaniam | Black-box constructions of complexity-preserving sublinear (ZK) arguments from symmetric primitives |
| 15:20-16:00 | Coffee break | |
| 16:00-16:50 | Iftach Haitner | Lower Bound on SNARGs in the Random Oracle Model |
| 19:30 | Dinner | |
| 21:00-21:50 | Eliran Kachlon | Verifiable Relation Sharing and Multi-Verifier Zero-Knowledge in Two Rounds: Trading NIZKs with Honest Majority |
| Friday | ||
| 07:30-09:00 | Breakfast | |
| 09:30-10:20 | Nick Spooner | Efficient zero knowledge proofs for disjunctions |
| 10:20-10:50 | Coffee break | |
| 10:50 | Farewell | |