–
Coffee and Check-In
–
Welcome Remarks
–
Mathematics of Lattices
Daniele Micciancio (UC San Diego)
–
Lunch
–
Algorithms for Lattice Problems
Noah Stephens-Davidowitz (MIT)
–
Break
–
Complexity of Lattice Problems
Noah Stephens-Davidowitz (MIT)
–
Reception
–
Coffee and Check-In
–
The Short Integer Solutions Problem and Cryptographic Applications
Daniele Micciancio (UC San Diego)
–
Lunch
–
The Learning With Errors Problem and Cryptographic Applications
Chris Peikert (University of Michigan, Ann Arbor)
–
Break
–
Algebraic Lattices and Ring Learning with Errors
Chris Peikert (University of Michigan, Ann Arbor)
–
Coffee and Check-In
–
Algorithms for Algebraic Lattices: Classical and Quantum
Leo Ducas (Centrum Wiskunde & Informatica)
–
Break
–
Algorithms for Lattice Problems, in Practice
Martin Albrecht (Royal Holloway, University of London)
–
Lunch
–
Using Lattices for Cryptanalysis
Nadia Heninger (UC San Diego)
–
Break
–
Lattices and the NIST PQ-crypto Standardization Process
Damien Stehle (École Normale Supérieure de Lyon)
–
Coffee and Check-In
–
Lattices and Encrypted Computation
Vinod Vaikuntanathan (MIT)
–
Break
–
Lattice Trapdoors
Shweta Agrawal (IIT, MADRAS)
–
Lunch
–
How to Use Lattice Trapdoors: IBE, ABE and More
Shweta Agrawal (IIT, MADRAS)
–
Break
–
Lattices, Multilinear Maps and Program Obfuscation
Yilei Chen (Visa Research)