Léo Ducas
Artificial Intelligence · 2013–2018
A researcher in the Science corpus: 8 papers; trusts 39 researchers and is trusted by 23 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 144 citations into it; #6,541 of 35,345 by trust here, #11,750 by citations
- Computational Theory and Mathematics — 81 citations into it; #8,394 of 12,182 by trust here, #5,465 by citations
- Information Systems — 30 citations into it; #5,028 of 8,771 by trust here, #4,682 by citations
- Computer Networks and Communications — 20 citations into it; #8,765 of 9,886 by trust here, #7,492 by citations
- Computer Vision and Pattern Recognition — 17 citations into it; #5,975 of 21,575 by trust here, #11,721 by citations
- Privacy & Security — 10 citations into it
- Electrical and Electronic Engineering — 6 citations into it
Whom Léo Ducas trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Vadim Lyubashevsky
- Chris Peikert
- Craig Gentry
- Oded Regev
- Daniele Micciancio
- Zvika Brakerski
- Tim Erhan Güneysu
- Shai Halevi
- Nicolas Gama
- Richard Lindner
Who trusts Léo Ducas overall
- Ilaria Chillotti
- Daniel J. Bernstein
- Shai Halevi
- Wei Dai
- Nicolas Gama
- Patrick Longa
- Abbas Acar
- Hao Chen
- E. Alkım
- Mariya Georgieva
Papers from Léo Ducas's perspective
Ordered by how strongly the researchers Léo Ducas trusts endorse each paper. Same corpus, a different order for every researcher.
- On Ideal Lattices and Learning with Errors over Rings
- On lattices, learning with errors, random linear codes, and cryptography
- Trapdoors for hard lattices and new cryptographic constructions
- Predicting Lattice Reduction (International Conference on the Theory and Application of Cryptographic Techniques)
- Lattice Signatures Without Trapdoors (IACR Cryptology ePrint Archive)
- New lattice based cryptographic constructions
- Noise-tolerant learning, the parity problem, and the statistical query model (Symposium on the Theory of Computing)
- Fully homomorphic encryption using ideal lattices
- Bonsai Trees, or How to Delegate a Lattice Basis (Journal of Cryptology)
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller (IACR Cryptology ePrint Archive)
Their papers
- 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 Subfield Lattice Attack on Overstretched NTRU Assumptions - Cryptanalysis of Some FHE and Graded Encoding Schemes (2016) — 256 citations
- Frodo: Take off the Ring! Practical, Quantum-Secure Key Exchange from LWE (2016) — 440 citations
- Post-quantum Key Exchange - A New Hope (2016) — 992 citations
- New directions in nearest neighbor searching with applications to lattice sieving (2016) — 390 citations
- FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second (2015) — 935 citations