Program
| Monday | ||
| 09:15-09:30 | Opening remarks | |
| 09:30-10:30 |
Vadim Lyubashevsky and Gregor Seiler |
LaBRADOR: Compact Proofs for R1CS from Module-SIS (Slides - Vadim, Slides - Gregor) |
| 10:30-11:00 | Coffee break | |
| 11:00-12:00 | Russell W. F. Lai | Lattice-based Succinct Arguments from Vanishing Polynomials (Slides) |
| 12:00-13:30 | Lunch | |
| 13:30-14:30 | Jonathan Bootle | Lattice-Based Succinct Arguments for NP with Polylogarithmic-Time Verification (Slides) |
| 14:30-15:00 | Coffee break | |
| 15:00-16:00 | David Wu | Functional Commitments and SNARKs from Lattices (Slides) |
| Tuesday | ||
| 09:30-10:30 | Thomas Attema | Knowledge Soundness Analysis of Interactive (Oracle) Proofs (Slides) |
| 10:30-11:00 | Coffee break | |
| 11:00-12:00 | Sarah Bordage | Distance Preservation for All Polynomial Generators (Slides) |
| 12:00-13:30 | Lunch | |
| 13:30-14:30 | Nick Spooner | Post-Quantum Zero Knowledge, Revisited (or: How to Do Quantum Rewinding Undetectably) |
| 14:30-15:00 | Coffee break | |
| 15:00-16:00 | Giulio Malavolta | Quantum Rewinding for Many-Round Protocols |
| 17:00-22:15 | Dinner at Tout un Monde | |
| Wednesday | ||
| 09:30-10:30 | Quang Dao | Spartan and Bulletproofs are simulation-extractable (for free!) (Slides) |
| 10:30-11:00 | Coffee break | |
| 11:00-12:00 | Muhammed Esgin | A Tale of Practical Verifiable Random Functions based on Post-Quantum Assumptions (Slides) |
| 12:00 | Farewell |