Lattice Crypto and Algorithms

May 20-25
University Residential Center
Bertinoro (Forlì-Cesena), Italy

Lattice based cryptography and the learning with errors (LWE) problem have, over the last decade, emerged as a potential strong foundation for post-quantum cryptography. Specifically, they have been shown to imply new and exciting functionality which is beyond any other class of computational assumptions. The most notable examples, perhaps, are Fully Homomorphic Encryption (FHE) and general Attribute Based Encryption (ABE). Additional functionality, e.g., some forms of program obfuscation, may also be within reach.

It has also been shown that basic lattice-based constructions such as digital signatures, pseudorandom functions and key exchange can be made very efficient. Furthermore, we now have growing interest from the government (NSA and NIST) and the industry (Google) in deploying lattice-based cryptographic solutions.

The workshop will bring together leading experts from around the world to discuss the latest advances and developments in lattice based cryptography, as well as discuss future challenges and form new collaborations towards addressing them.