About the Workshop
Lattices are beautiful mathematical objects with a long and rich history, and diverse applications ranging from Diophantine approximation to combinatorial optimization to cryptography to complexity theory.
This workshop is aimed at learning about some recent advances in lattice based cryptography and algorithms. We will explore numerous facets of lattices, including classic and modern algorithms, hardness of lattice problems, cutting edge cryptographic constructions as well as efficient real world protocols. The target audience is researchers and advanced students in the area of theoretical computer science. No prior knowledge of lattices is assumed.
The event is co-organized by Shweta Agrawal (IIT Madras) and Vinod Vaikuntanathan (MIT).
Ecole Normale Superieure de Lyon.
National University of Singapore.
University of California, San Diego.
Google, Mountain View.
- 9:00-10:00 am: Divesh Aggarwal: (Gap/S)-ETH Hardness of SVP. Slides are here.
- 10:00-11:00 am: Noah Stephens-Davidowitz: An Embarrassingly Simple 2^n Time Algorithm for SVP -- and How We Hope To Improve it. Slides are here.
- 11:00-11:30 am: Coffee Break.
- 11:30-12:30 pm: Damien Stehle: Sieving Algorithms for Lattice Problems. Slides are here.
- 12:30-2:00 pm: Lunch.
- 2:00-3:00 pm: Michael Walter: Gaussian Sampling over the Integers: Efficient, Generic, Constant-Time. Slides are here.
- 3:00-4:00 pm: Ananth Raghunathan: Frodo: Take off the Ring! Practical Quantum-Secure Key Encapsulation from Lattices. Slides are here.
- 4:00-4:30 pm: Coffee Break.
- 4:30-5:30 pm: Vinod Vaikuntanathan: A decade of Fully Homomorphic Encryption. Board talk, no slides.