Follow
Vadim Lyubashevsky
Vadim Lyubashevsky
IBM Research Europe, Zurich
Verified email at zurich.ibm.com - Homepage
Title
Cited by
Cited by
Year
On ideal lattices and learning with errors over rings
V Lyubashevsky, C Peikert, O Regev
Journal of the ACM (JACM) 60 (6), 43, 2013
23742013
Lattice Signatures Without Trapdoors
V Lyubashevsky
Advances in Cryptology–EUROCRYPT 2012, 738-755, 2012
7602012
CRYSTALS-Kyber: a CCA-secure module-lattice-based KEM
J Bos, L Ducas, E Kiltz, T Lepoint, V Lyubashevsky, JM Schanck, ...
2018 IEEE European Symposium on Security and Privacy (EuroS&P), 353-367, 2018
744*2018
Lattice Signatures and Bimodal Gaussians
L Ducas, A Durmus, T Lepoint, V Lyubashevsky
Advances in Cryptology–CRYPTO 2013, 40-56, 2013
6112013
Crystals-dilithium: A lattice-based digital signature scheme
L Ducas, E Kiltz, T Lepoint, V Lyubashevsky, P Schwabe, G Seiler, ...
IACR Transactions on Cryptographic Hardware and Embedded Systems, 238-268, 2018
509*2018
Fiat-Shamir with aborts: Applications to lattice and factoring-based signatures
V Lyubashevsky
Advances in Cryptology–ASIACRYPT 2009: 15th International Conference on the …, 2009
4922009
A toolkit for ring-LWE cryptography
V Lyubashevsky, C Peikert, O Regev
Advances in Cryptology–EUROCRYPT 2013: 32nd Annual International Conference …, 2013
4692013
Generalized compact knapsacks are collision resistant
V Lyubashevsky, D Micciancio
Automata, Languages and Programming: 33rd International Colloquium, ICALP …, 2006
4132006
Practical lattice-based cryptography: A signature scheme for embedded systems
T Güneysu, V Lyubashevsky, T Pöppelmann
International Workshop on Cryptographic Hardware and Embedded Systems, 530-547, 2012
3382012
SWIFFT: A modest proposal for FFT hashing
V Lyubashevsky, D Micciancio, C Peikert, A Rosen
Fast Software Encryption: 15th International Workshop, FSE 2008, Lausanne …, 2008
3042008
Falcon: Fast-Fourier lattice-based compact signatures over NTRU
PA Fouque, J Hoffstein, P Kirchner, V Lyubashevsky, T Pornin, T Prest, ...
Submission to the NIST’s post-quantum cryptography standardization process …, 2018
287*2018
Efficient identity-based encryption over NTRU lattices
L Ducas, V Lyubashevsky, T Prest
Advances in Cryptology–ASIACRYPT 2014: 20th International Conference on the …, 2014
2352014
Lattice-based identification schemes secure under active attacks
V Lyubashevsky
Public Key Cryptography–PKC 2008: 11th International Workshop on Practice …, 2008
2192008
Asymptotically efficient lattice-based digital signatures
V Lyubashevsky, D Micciancio
Theory of Cryptography: Fifth Theory of Cryptography Conference, TCC 2008 …, 2008
2092008
The parity problem in the presence of noise, decoding random linear codes, and the subset sum problem
V Lyubashevsky
Approximation, randomization and combinatorial optimization. Algorithms and …, 2005
1722005
On bounded distance decoding, unique shortest vectors, and the minimum distance problem
V Lyubashevsky, D Micciancio
Advances in Cryptology-CRYPTO 2009: 29th Annual International Cryptology …, 2009
1712009
A concrete treatment of Fiat-Shamir signatures in the quantum random-oracle model
E Kiltz, V Lyubashevsky, C Schaffner
Advances in Cryptology–EUROCRYPT 2018: 37th Annual International Conference …, 2018
1422018
Better zero-knowledge proofs for lattice encryption and their application to group signatures
F Benhamouda, J Camenisch, S Krenn, V Lyubashevsky, G Neven
Advances in Cryptology–ASIACRYPT 2014: 20th International Conference on the …, 2014
1172014
More efficient commitments from structured lattice assumptions
C Baum, I Damgård, V Lyubashevsky, S Oechsner, C Peikert
Security and Cryptography for Networks: 11th International Conference, SCN …, 2018
1052018
Public-key cryptographic primitives provably as secure as subset sum
V Lyubashevsky, A Palacio, G Segev
Theory of Cryptography: 7th Theory of Cryptography Conference, TCC 2010 …, 2010
922010
The system can't perform the operation now. Try again later.
Articles 1–20