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 this program 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: subscribe%20lattices2020announcements%40lists.simons.berkeley.edu) (Click here to subscribe to our announcements email list for this program).
Long-Term Participants (tentative list, including organizers):
Shweta Agrawal (IIT, Madras), Martin Albrecht (Royal Holloway, University of London), Dan Boneh (Stanford University), Elette Boyle (IDC Herzliya), Yilei Chen (Visa Research), (Daniel Dadush (CWI), Nico Döttling (CISPA, Saarbrucken), Pierre-Alain Fouque (Université Rennes), Shafi Goldwasser (UC Berkeley), Sergey Gorbunov (University of Waterloo), Nadia Heninger (University of Pennsylvania), Yuval Ishai (Technion - Israel Institute of Technology), Ravi Kannan (Microsoft Research India), Elena Kirshanova (ENS Lyon), Thijs Laarhoven (Eindhoven University of Technology), Tancrède Lepoint (Google LLC), Huijia Lin (University of Washington), Vadim Lyubashevsky (École Normale Supérieure Paris), Alexander May (Ruhr-Universität Bochum), Arya Mazumdar (University of Massachusetts Amherst), Daniele Micciancio (UCSD), Alice Pellet--Mary (KU Leuven), Amit Sahai (UCLA), Alice Silverberg (UC Irvine), Damien Stehlé (École Normale Supérieure de Lyon), Stefano Tessaro (University of Washington), Vinod Vaikuntanathan (MIT), Prashant Vasudevan (UC Berkeley), Michael Walter (IST Austria), Brent Waters (UT Austin and NTT Research), Hoeteck Wee (ENS Paris), Daniel Wichs (Northeastern University), Shota Yamada (AIST).
Leo Ducas (Centrum Wiskunde & Informatica, VMware Research Fellow), Rishab Goya (UT Austin), Justin Holmgren (Princeton University), Dakshita Khurana (Microsoft Research, Microsoft Research Fellow), Sam Kim (Stanford University), Venkata Koppula (Weizmann Institute of Science), Fang Song (Texas A&M U), Noah Stephens-Davidowitz (Massachusetts Institute of Technology, Microsoft Research Fellow)