PDFs of some survey talks:

Lattice Encryption Schemes

Lattice Signature Schemes

Basic Lattice Cryptanalysis

Ideal Lattices and Ring-LWE

NTRU and FHE

SIS and Worst-Case to Average-Case Reductions

The LPN Problem in Cryptography

Publications:

Vadim Lyubashevsky, Thomas Prest

Quadratic time, linear space algorithms for Gram-Schmidt orthogonalization and Gaussian sampling in structured lattices

In Eurocrypt 2015 pdf

Vadim Lyubashevsky, Daniel Wichs

Simple lattice trapdoor sampling from a broad class of distributions

In Public Key Cryptography (PKC) 2015 pdf

Fabrice Benhamouda, Jan Camenisch, Stephan Krenn, Vadim Lyubashevsky, Gregory Neven

Better zero-knowledge proofs for lattice encryption and their application to group signatures

In Asiacrypt 2014 pdf

Leo Ducas, Vadim Lyubashevsky, Thomas Prest

Efficient identity-based encryption over NTRU lattices

In Asiacrypt 2014 pdf

Vadim Lyubashevsky, Daniel Masny

Man-in-the-middle secure authentication schemes from LPN and weak PRFs

In Crypto 2013 pdf

Leo Ducas, Alain Durmus, Tancrede Lepoint, Vadim Lyubashevsky

Lattice signatures and bimodal Gaussians

In Crypto 2013 pdf

Vadim Lyubashevsky, Chris Peikert, Oded Regev

A toolkit for Ring-LWE cryptography

In Eurocrypt 2013 pdf

Tim Guneysu, Vadim Lyubashevsky, Thomas Poppelmann

Practical lattice-based cryptography: A signature scheme for embedded systems

In Workshop on Cryptographic Hardware and Embedded Systems (CHES) 2012 pdf

Michel Abdalla, Dario Fiore, Vadim Lyubashevsky

From selective to full security: Semi-generic transformations in the standard model

In Public Key Cryptography (PKC) 2012 pdf

Stefan Heyse, Eike Kiltz, Vadim Lyubashevsky, Christof Paar, Krzysztof Pietrzak

Lapin: An efficient authentication protocol based on Ring-LPN

In Fast Software Encryption (FSE) 2012 pdf

Vadim Lyubashevsky

Lattice signatures without trapdoors

In Eurocrypt 2012 pdf

Michel Abdalla, Pierre-Alain Fouque, Vadim Lyubashevsky, Mehdi Tibouchi

Tightly-secure signatures from lossy identification schemes

In Eurocrypt 2012 pdf

Vadim Lyubashevsky

Search to decision reduction for the learning with errors over rings problem

Invited paper at the 2011 Information Theory Workshop (ITW 2011) pdf

Vadim Lyubashevsky, Chris Peikert, Oded Regev

On ideal lattices and learning with errors over rings

In Eurocrypt 2010 pdf

Vadim Lyubashevsky, Adriana Palacio, Gil Segev

Public-key cryptographic primitives provably as secure as subset sum

In Theory of Cryptography Conference (TCC) 2010 pdf

Vadim Lyubashevsky

Fiat-Shamir with aborts: Applications to lattice and factoring-based signatures

In Asiacrypt 2009 pdf

Vadim Lyubashevsky, Daniele Micciancio

On bounded distance decoding, unique shortest vectors, and the minimum distance problem

In Crypto 2009 pdf

Yuriy Arbitman, Gil Dogon, Vadim Lyubashevsky, Daniele Micciancio, Chris Peikert, Alon Rosen

SWIFFTX: A Proposal for the SHA-3 standard

In the First SHA-3 Candidate Conference pdf

Ishay Haviv, Vadim Lyubashevsky, Oded Regev

A note on the distribution of the distance from a lattice

In Discrete & Computational Geometry Vol. 41 No. 1 2009 pdf

Vadim Lyubashevsky

Lattice-based identification schemes secure under active attacks

In Public Key Cryptography (PKC) 2008 (Received the Best Paper Award) pdf

Vadim Lyubashevsky, Daniele Micciancio

Asymptotically efficient lattice-based digital signatures

In Theory of Cryptography Conference (TCC) 2008 pdf full version

Vadim Lyubashevsky, Daniele Micciancio, Chris Peikert, Alon Rosen

SWIFFT: A modest proposal for FFT hashing

In Fast Software Encryption (FSE) 2008 pdf

Yi-Kai Liu, Vadim Lyubashevsky, Daniele Micciancio

On bounded distance decoding for general lattices

In RANDOM 2006 pdf

Vadim Lyubashevsky, Daniele Micciancio

Generalized compact knapsacks are collision resistant

In ICALP 2006 pdf full version

Vadim Lyubashevsky

The parity problem in the presence of noise, decoding random linear codes, and the subset sum problem

In RANDOM 2005 pdf

Lattice Encryption Schemes

Lattice Signature Schemes

Basic Lattice Cryptanalysis

Ideal Lattices and Ring-LWE

NTRU and FHE

SIS and Worst-Case to Average-Case Reductions

The LPN Problem in Cryptography

Publications:

Vadim Lyubashevsky, Thomas Prest

Quadratic time, linear space algorithms for Gram-Schmidt orthogonalization and Gaussian sampling in structured lattices

In Eurocrypt 2015 pdf

Vadim Lyubashevsky, Daniel Wichs

Simple lattice trapdoor sampling from a broad class of distributions

In Public Key Cryptography (PKC) 2015 pdf

Fabrice Benhamouda, Jan Camenisch, Stephan Krenn, Vadim Lyubashevsky, Gregory Neven

Better zero-knowledge proofs for lattice encryption and their application to group signatures

In Asiacrypt 2014 pdf

Leo Ducas, Vadim Lyubashevsky, Thomas Prest

Efficient identity-based encryption over NTRU lattices

In Asiacrypt 2014 pdf

Vadim Lyubashevsky, Daniel Masny

Man-in-the-middle secure authentication schemes from LPN and weak PRFs

In Crypto 2013 pdf

Leo Ducas, Alain Durmus, Tancrede Lepoint, Vadim Lyubashevsky

Lattice signatures and bimodal Gaussians

In Crypto 2013 pdf

Vadim Lyubashevsky, Chris Peikert, Oded Regev

A toolkit for Ring-LWE cryptography

In Eurocrypt 2013 pdf

Tim Guneysu, Vadim Lyubashevsky, Thomas Poppelmann

Practical lattice-based cryptography: A signature scheme for embedded systems

In Workshop on Cryptographic Hardware and Embedded Systems (CHES) 2012 pdf

Michel Abdalla, Dario Fiore, Vadim Lyubashevsky

From selective to full security: Semi-generic transformations in the standard model

In Public Key Cryptography (PKC) 2012 pdf

Stefan Heyse, Eike Kiltz, Vadim Lyubashevsky, Christof Paar, Krzysztof Pietrzak

Lapin: An efficient authentication protocol based on Ring-LPN

In Fast Software Encryption (FSE) 2012 pdf

Vadim Lyubashevsky

Lattice signatures without trapdoors

In Eurocrypt 2012 pdf

Michel Abdalla, Pierre-Alain Fouque, Vadim Lyubashevsky, Mehdi Tibouchi

Tightly-secure signatures from lossy identification schemes

In Eurocrypt 2012 pdf

Vadim Lyubashevsky

Search to decision reduction for the learning with errors over rings problem

Invited paper at the 2011 Information Theory Workshop (ITW 2011) pdf

Vadim Lyubashevsky, Chris Peikert, Oded Regev

On ideal lattices and learning with errors over rings

In Eurocrypt 2010 pdf

Vadim Lyubashevsky, Adriana Palacio, Gil Segev

Public-key cryptographic primitives provably as secure as subset sum

In Theory of Cryptography Conference (TCC) 2010 pdf

Vadim Lyubashevsky

Fiat-Shamir with aborts: Applications to lattice and factoring-based signatures

In Asiacrypt 2009 pdf

Vadim Lyubashevsky, Daniele Micciancio

On bounded distance decoding, unique shortest vectors, and the minimum distance problem

In Crypto 2009 pdf

Yuriy Arbitman, Gil Dogon, Vadim Lyubashevsky, Daniele Micciancio, Chris Peikert, Alon Rosen

SWIFFTX: A Proposal for the SHA-3 standard

In the First SHA-3 Candidate Conference pdf

Ishay Haviv, Vadim Lyubashevsky, Oded Regev

A note on the distribution of the distance from a lattice

In Discrete & Computational Geometry Vol. 41 No. 1 2009 pdf

Vadim Lyubashevsky

Lattice-based identification schemes secure under active attacks

In Public Key Cryptography (PKC) 2008 (Received the Best Paper Award) pdf

Vadim Lyubashevsky, Daniele Micciancio

Asymptotically efficient lattice-based digital signatures

In Theory of Cryptography Conference (TCC) 2008 pdf full version

Vadim Lyubashevsky, Daniele Micciancio, Chris Peikert, Alon Rosen

SWIFFT: A modest proposal for FFT hashing

In Fast Software Encryption (FSE) 2008 pdf

Yi-Kai Liu, Vadim Lyubashevsky, Daniele Micciancio

On bounded distance decoding for general lattices

In RANDOM 2006 pdf

Vadim Lyubashevsky, Daniele Micciancio

Generalized compact knapsacks are collision resistant

In ICALP 2006 pdf full version

Vadim Lyubashevsky

The parity problem in the presence of noise, decoding random linear codes, and the subset sum problem

In RANDOM 2005 pdf

I am at IBM Research - Zurich

I am an INRIA researcher (chargé de recherche) in the crypto group at the École Normale Supérieure, Paris.

Prior to this, I was a post-doc in the Foundations of Computing group at Tel-Aviv University, hosted by Oded Regev.

I received my Ph.D. from the University of California, San Diego in August 2008, where I was privileged to have Daniele Micciancio as my advisor. My thesis was on building efficient, provably secure cryptographic functions based on the hardness of lattice problems.

I was/am/will be on the following program committees:

PQC 2010, PKC 2010, Latincrypt 2010, Asiacrypt 2010,

TCC 2011, Eurocrypt 2011, PQC 2011, Indocrypt 2011

TCC 2012 , PKC 2012 , Latincrypt 2012 , Eurocrypt 2013 ,

Crypto 2013 , PKC 2014