| On ideal lattices and learning with errors over rings V Lyubashevsky, C Peikert, O Regev Annual International Conference on the Theory and Applications of …, 2010 | 1704 | 2010 |
| Lattice Signatures Without Trapdoors V Lyubashevsky Advances in Cryptology–EUROCRYPT 2012, 738-755, 2012 | 702 | 2012 |
| 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 | 615* | 2018 |
| On ideal lattices and learning with errors over rings V Lyubashevsky, C Peikert, O Regev Journal of the ACM (JACM) 60 (6), 43, 2013 | 597 | 2013 |
| Lattice Signatures and Bimodal Gaussians L Ducas, A Durmus, T Lepoint, V Lyubashevsky Advances in Cryptology–CRYPTO 2013, 40-56, 2013 | 590 | 2013 |
| Fiat-Shamir with aborts: Applications to lattice and factoring-based signatures V Lyubashevsky International Conference on the Theory and Application of Cryptology and …, 2009 | 452 | 2009 |
| 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 | 438* | 2018 |
| A toolkit for ring-LWE cryptography V Lyubashevsky, C Peikert, O Regev Annual international conference on the theory and applications of …, 2013 | 437 | 2013 |
| Generalized compact knapsacks are collision resistant V Lyubashevsky, D Micciancio International Colloquium on Automata, Languages, and Programming, 144-155, 2006 | 389 | 2006 |
| 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 | 324 | 2012 |
| SWIFFT: A modest proposal for FFT hashing V Lyubashevsky, D Micciancio, C Peikert, A Rosen International workshop on fast software encryption, 54-72, 2008 | 296 | 2008 |
| Efficient identity-based encryption over NTRU lattices L Ducas, V Lyubashevsky, T Prest International Conference on the Theory and Application of Cryptology and …, 2014 | 216 | 2014 |
| Lattice-based identification schemes secure under active attacks V Lyubashevsky International workshop on public key cryptography, 162-179, 2008 | 210 | 2008 |
| Asymptotically efficient lattice-based digital signatures V Lyubashevsky, D Micciancio Theory of Cryptography Conference, 37-54, 2008 | 203 | 2008 |
| 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 | 172* | 2018 |
| 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 | 170 | 2005 |
| On bounded distance decoding, unique shortest vectors, and the minimum distance problem V Lyubashevsky, D Micciancio Annual International Cryptology Conference, 577-594, 2009 | 161 | 2009 |
| A concrete treatment of Fiat-Shamir signatures in the quantum random-oracle model E Kiltz, V Lyubashevsky, C Schaffner Annual International Conference on the Theory and Applications of …, 2018 | 124 | 2018 |
| Better zero-knowledge proofs for lattice encryption and their application to group signatures F Benhamouda, J Camenisch, S Krenn, V Lyubashevsky, G Neven International Conference on the Theory and Application of Cryptology and …, 2014 | 111 | 2014 |
| More efficient commitments from structured lattice assumptions C Baum, I Damgård, V Lyubashevsky, S Oechsner, C Peikert International Conference on Security and Cryptography for Networks, 368-385, 2018 | 93 | 2018 |
Chris PeikertProfessor, Computer Science and Engineering, University of MichiganVerified email at alum.mit.edu
