Beginning in the late 1990s it was shown that public-key cryptographic primitives can be built from hard computational problems related to lattices.
Research in this area has taken off in recent years and has focused on extending lattice-based functionalities, understanding the relationships between various hard lattice problems, and placing lattice-based cryptosystems in a provable-security framework. As a result, our lattice-based toolbox now includes (among others) chosen-ciphertext secure encryption, hierarchical identity-based encryption, and fully homomorphic encryption.
This two-day workshop will feature lectures by leading experts on lattices and public-key cryptography. The talks on the first day are intended for an audience familiar with lattices or cryptography, but not necessarily the interaction between the two. The talks on the second day will focus on important recent research results.
The immediate goal of the workshop is for a graduate student or researcher in the field who has a background in public-key cryptography, but not lattices in particular, to be able to understand the important current problems in lattice-based cryptography and the tools used to solve them. The long term goal is to inspire interest and collaboration that leads to further progress in the field.
The lectures on May 7 are part of the Intercity Number Theory Seminar.
A two-day workshop on the use of lattices in the construction of public-key cryptographic protocols. The first day will provide an introduction to the subject, and the second day will focus on recent research results.
Abstracts of talks
Lectures will take place in the Tinbergenzaal of the Trippenhuis, home of the Royal Netherlands Academy of Arts and Sciences. The venue is conveniently located at in the heart of Amsterdam, less than 1 km from Central Station.
1011 JV Amsterdam
Map of venue location.
There will be a cocktail reception on Thursday evening. The location (in central Amsterdam) will be announced at the lectures.
(Click a talk title to see the abstract.)
Click here for full list.