Vadim Lyubashevsky is currently an Inria researcher working in the cryptography group of the École Normale Supérieure in Paris. After completing his undergraduate studies at Columbia University, he received his PhD from the University of California San Diego in 2008, and then spent two years as a post-doc at Tel-Aviv University. Vadim’s main area of research expertise is in designing efficient cryptographic schemes based on the hardness of problems in algebraic lattices. These constructions, which are believed to remain resistant to quantum algorithms, could one day replace many of the schemes that are being used today. They also serve as foundations for novel and exciting primitives such as fully-homomorphic encryption. Together with his colleagues and students, he continues to strive towards making all lattice-based constructions truly practical.
- Lattices: Algorithms, Complexity, and Cryptography, Spring 2020. Workshop Organizer.