Spring 2020

Lattices: Algorithms, Complexity and Cryptography

Jan. 14May 15, 2020
The study of integer lattices serves as a bridge between number theory and geometry and has for centuries received the attention of illustrious mathematicians including Lagrange, Gauss, Dirichlet, Hermite and Minkowski. In computer science, lattices made a grand appearance in 1982 with the celebrated work of Lenstra, Lenstra and Lovász, who developed the celebrated LLL algorithm to find short vectors in integer lattices. The role of lattices in cryptography has been equally, if not more, revolutionary and dramatic, playing first a destructive role as a potent tool for breaking cryptosystems, and later as a new way to realize powerful and game-changing notions such as fully homomorphic encryption. These exciting developments over the last two decades have taken us on a journey through such diverse areas as quantum computation, learning theory, Fourier analysis and algebraic number theory. 
We stand today at a turning point in the study of lattices. The promise of practical lattice-based cryptosystems together with their apparent quantum-resistance is generating a tremendous amount of interest in deploying these schemes at internet scale. However, before lattice cryptography goes live, we need major advances in understanding the hardness of lattice problems that underlie the security of these cryptosystems. Significant, ground-breaking progress on these questions requires a concerted effort by researchers from many different areas: (algebraic) number theory, (quantum) algorithms, optimization, cryptography and coding theory.
The goal of the proposed special semester is to bring together experts in these areas in order to attack some of the main outstanding open questions, and to discover new connections between lattices, computer science, and mathematics. The need to thoroughly understand the computational landscape and cryptographic capabilities of lattice problems is greater now than ever, given the possibility that secure communication on the internet and secure collaboration on the cloud might soon be powered by lattices.

sympa [at] lists [dot] simons [dot] berkeley [dot] edu (body: (Click here to subscribe to our announcements email list for this program).

Shafi Goldwasser (UC Berkeley; chair), Vinod Vaikuntanathan (MIT; chair), Daniele Micciancio (UCSD), Oded Regev (Courant Institute of Mathematical Sciences, New York University), Hoeteck Wee (ENS Paris)
Long-Term Participants (tentative list, including organizers):
Zvika Brakerski (Weizmann Institute), David Cash (University of Chicago), Daniel Dadush (CWI), Pierre-Alain Fouque (Université Rennes), Sanjam Garg (UC Berkeley), Shafi Goldwasser (UC Berkeley), Sergey Gorbunov (University of Waterloo), Nadia Heninger (University of Pennsylvania), Antoine Joux (Institut de Mathématiques de Jussieu), Ravi Kannan (Microsoft), Kristin Lauter (Microsoft), Daniele Micciancio (UCSD), Alon Rosen (IDC Herzliya), Amit Sahai (UCLA), Alice Silverberg (UC Irvine), Vinod Vaikuntanathan (MIT), Hoeteck Wee (ENS Paris)


Those interested in participating in this program should send an email to the organizers at this lattices2020 [at] lists [dot] simons [dot] berkeley [dot] edu (at this address)