|
Vadim Lyubashevsky
|
||
Department of Computer Science and Engineering
|
I am a Ph.D. student in computer science at the University
of California,
San Diego. My interests lie in cryptography, information security, and theoretical computer science.
Most of my work has dealt with building efficient, provably secure
cryptographic functions based on the hardness of lattice problems.
I have been privileged to work under the guidance
of my advisor, Daniele
Micciancio.
Publications: V. Lyubashevsky "Lattice-based identification schemes secure under active attacks " In Public Key Cryptography (PKC) 2008 (Best Paper Award) . pdf V. Lyubashevsky, D. Micciancio "Asymptotically efficient lattice-based digital signatures " In Theory of Cryptography Conference (TCC) 2008. pdf V. Lyubashevsky, D. Micciancio, C. Peikert, A. Rosen " SWIFFT: A modest proposal for FFT hashing " In Fast Software Encryption (FSE) 2008 pdf Y.-K. Liu, V. Lyubashevsky, D. Micciancio "On bounded distance decoding for general lattices " In RANDOM 2006 pdf V. Lyubashevsky, D. Micciancio, C. Peikert, A. Rosen " Provably secure FFT hashing " In NIST 2nd Cryptogaphic Hash Function Workshop pdf V. Lyubashevsky, D. Micciancio "Generalized compact knapsacks are collision resistant" In ICALP 2006 pdf full version V. Lyubashevsky "The parity problem in the presence of noise, decoding random linear codes, and the subset sum problem" In RANDOM 2005 pdf V. Lyubashevsky, C. Newell, V. Ponomarenko "Geometry of jump systems" In Rocky Mountain Journal of Mathematics, vol. 35, num.5, 2005
|
|