Publications:

Vadim Lyubashevsky
Fiat-Shamir with aborts: Applications to lattice and factoring-based signatures
In Asiacrypt 2009  pdf

Vadim Lyubashevsky and 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, and Alon Rosen
SWIFFTX: A Proposal for the SHA-3 standard 
In the First SHA-3 Candidate Conference  pdf  

Ishay Haviv,  Vadim Lyubashevsky,  and 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 and Daniele Micciancio
Asymptotically efficient lattice-based digital signatures 
In Theory of Cryptography Conference (TCC) 2008  pdf   

Vadim Lyubashevsky, Daniele Micciancio, Chris Peikert, and Alon Rosen
SWIFFT: A modest proposal for FFT hashing 
In Fast Software Encryption (FSE) 2008  pdf  

Yi-Kai Liu, Vadim Lyubashevsky, and Daniele Micciancio
On bounded distance decoding for general lattices 
In RANDOM 2006  pdf

Vadim Lyubashevsky and 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