Vadim Lyubashevsky
Artificial Intelligence · 2006–2018
A researcher in the Science corpus: 10 papers; trusts 53 researchers and is trusted by 94 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 169 citations into it; #2,502 of 36,961 by trust here, #4,440 by citations
- Computational Theory and Mathematics — 100 citations into it; #248 of 12,489 by trust here, #570 by citations
- Computer Networks and Communications — 34 citations into it
- Computer Vision and Pattern Recognition — 33 citations into it; #5,050 of 21,973 by trust here, #8,985 by citations
- Information Systems — 27 citations into it; #891 of 9,233 by trust here, #3,294 by citations
- Privacy & Security — 14 citations into it
- Political Science and International Relations — 7 citations into it
Whom Vadim Lyubashevsky trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Chris Peikert
- Daniele Micciancio
- Oded Regev
- Craig Gentry
- Damien Stehlé
- Nicolas Gama
- Amos Fiat
- David Cash
- Vinod Vaikuntanathan
- Zvika Brakerski
Who trusts Vadim Lyubashevsky overall
- Léo Ducas
- Chris Peikert
- Damien Stehlé
- Tim Erhan Güneysu
- Daniele Micciancio
- Oded Regev
- Hao Chen
- Patrick Longa
- Adeline Langlois
- Craig Gentry
Papers from Vadim Lyubashevsky's perspective
Ordered by how strongly the researchers Vadim Lyubashevsky trusts endorse each paper. Same corpus, a different order for every researcher.
- Trapdoors for hard lattices and new cryptographic constructions
- On lattices, learning with errors, random linear codes, and cryptography
- On Ideal Lattices and Learning with Errors over Rings
- Noise-tolerant learning, the parity problem, and the statistical query model (Symposium on the Theory of Computing)
- Fully homomorphic encryption using ideal lattices
- Lossy trapdoor functions and their applications (SIAM journal on computing (Print))
- Predicting Lattice Reduction (International Conference on the Theory and Application of Cryptographic Techniques)
- New lattice based cryptographic constructions
- Random oracles are practical: a paradigm for designing efficient protocols
- Collision-Free Hashing from Lattice Problems
Their papers
- On Ideal Lattices and Learning with Errors over Rings (2010) — 2,898 citations
- Lattice Signatures Without Trapdoors (2012) — 892 citations
- Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems (2012) — 361 citations
- Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures (2009) — 609 citations
- Lattice Signatures and Bimodal Gaussians (2013) — 638 citations
- CRYSTALS - Kyber: A CCA-Secure Module-Lattice-Based KEM (2017) — 1,190 citations
- CRYSTALS-Dilithium: A Lattice-Based Digital Signature Scheme (2018) — 826 citations
- A Toolkit for Ring-LWE Cryptography (2013) — 493 citations
- SWIFFT: A Modest Proposal for FFT Hashing (2008) — 311 citations
- Generalized Compact Knapsacks Are Collision Resistant (2006) — 389 citations