| 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 | 1166 | 2010 |
| Lattice Signatures Without Trapdoors V Lyubashevsky Advances in Cryptology–EUROCRYPT 2012, 738-755, 2012 | 492 | 2012 |
| Lattice Signatures and Bimodal Gaussians L Ducas, A Durmus, T Lepoint, V Lyubashevsky Advances in Cryptology–CRYPTO 2013, 40-56, 2013 | 450 | 2013 |
| On ideal lattices and learning with errors over rings V Lyubashevsky, C Peikert, O Regev Journal of the ACM (JACM) 60 (6), 43, 2013 | 401 | 2013 |
| A toolkit for ring-LWE cryptography V Lyubashevsky, C Peikert, O Regev Annual International Conference on the Theory and Applications of …, 2013 | 314 | 2013 |
| Generalized compact knapsacks are collision resistant V Lyubashevsky, D Micciancio International Colloquium on Automata, Languages, and Programming, 144-155, 2006 | 312 | 2006 |
| Fiat-Shamir with aborts: Applications to lattice and factoring-based signatures V Lyubashevsky International Conference on the Theory and Application of Cryptology and …, 2009 | 293 | 2009 |
| SWIFFT: A modest proposal for FFT hashing V Lyubashevsky, D Micciancio, C Peikert, A Rosen International Workshop on Fast Software Encryption, 54-72, 2008 | 258 | 2008 |
| 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 | 239* | 2018 |
| 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 | 239 | 2012 |
| Asymptotically efficient lattice-based digital signatures V Lyubashevsky, D Micciancio Theory of Cryptography Conference, 37-54, 2008 | 183 | 2008 |
| Lattice-based identification schemes secure under active attacks V Lyubashevsky International Workshop on Public Key Cryptography, 162-179, 2008 | 182 | 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 | 148 | 2014 |
| 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 | 148 | 2005 |
| On bounded distance decoding, unique shortest vectors, and the minimum distance problem V Lyubashevsky, D Micciancio Annual International Cryptology Conference, 577-594, 2009 | 136 | 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 | 135* | 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 | 79 | 2014 |
| Lapin: An efficient authentication protocol based on ring-LPN S Heyse, E Kiltz, V Lyubashevsky, C Paar, K Pietrzak International Workshop on Fast Software Encryption, 346-365, 2012 | 75 | 2012 |
| Public-key cryptographic primitives provably as secure as subset sum V Lyubashevsky, A Palacio, G Segev Theory of Cryptography Conference, 382-400, 2010 | 66 | 2010 |
| Tightly-secure signatures from lossy identification schemes M Abdalla, PA Fouque, V Lyubashevsky, M Tibouchi Annual International Conference on the Theory and Applications of …, 2012 | 62 | 2012 |
Chris PeikertAssociate Professor, Computer Science and Engineering, University of MichiganVerified email at alum.mit.edu
