Damien Stehlé
Artificial Intelligence · 2009–2018
A researcher in the Science corpus: 9 papers; trusts 40 researchers and is trusted by 55 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 134 citations into it; #2,969 of 35,345 by trust here, #7,241 by citations
- Computational Theory and Mathematics — 80 citations into it; #623 of 12,182 by trust here, #1,700 by citations
- Computer Vision and Pattern Recognition — 28 citations into it
- Information Systems — 23 citations into it; #370 of 8,771 by trust here, #1,740 by citations
- Computer Networks and Communications — 19 citations into it; #3,821 of 9,886 by trust here, #4,405 by citations
- Privacy & Security — 11 citations into it
Whom Damien Stehlé trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Chris Peikert
- Craig Gentry
- Daniele Micciancio
- Oded Regev
- Vadim Lyubashevsky
- W. Hoeffding
- Vinod Vaikuntanathan
- Dan Boneh
- Nigel P. Smart
- Shafi Goldwasser
Who trusts Damien Stehlé overall
- Vadim Lyubashevsky
- Yarkin Doröz
- Joppe W. Bos
- Wei Dai
- Erdinç Öztürk
- Berk Sunar
- Jintai Ding
- Chris Peikert
- Abbas Acar
- Kristin E. Lauter
Papers from Damien Stehlé's perspective
Ordered by how strongly the researchers Damien Stehlé 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
- Fully homomorphic encryption using ideal lattices
- Predicting Lattice Reduction (International Conference on the Theory and Application of Cryptographic Techniques)
- On Ideal Lattices and Learning with Errors over Rings
- Lossy trapdoor functions and their applications (SIAM journal on computing (Print))
- Noise-tolerant learning, the parity problem, and the statistical query model (Symposium on the Theory of Computing)
- Collision-Free Hashing from Lattice Problems
- A fully homomorphic encryption scheme
- New lattice based cryptographic constructions
Their papers
- Efficient Public Key Encryption Based on Ideal Lattices (2009) — 430 citations
- Worst-case to average-case reductions for module lattices (2014) — 717 citations
- Making NTRU as Secure as Worst-Case Problems over Ideal Lattices (2011) — 468 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
- GGHLite: More Efficient Multilinear Maps from Ideal Lattices (2014) — 182 citations
- Making NTRUEncrypt and NTRUSign as Secure as Standard Worst-Case Problems over Ideal Lattices (2013) — 85 citations
- Classical hardness of learning with errors (2013) — 743 citations
- Faster Fully Homomorphic Encryption (2010) — 342 citations