Nicolas Gama
Artificial Intelligence · 2008–2019
A researcher in the Science corpus: 6 papers; trusts 31 researchers and is trusted by 41 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 62 citations into it; #4,571 of 35,345 by trust here, #11,327 by citations
- Computational Theory and Mathematics — 47 citations into it; #6,795 of 12,182 by trust here, #4,531 by citations
- Computer Vision and Pattern Recognition — 11 citations into it; #19,522 of 21,575 by trust here, #18,782 by citations
- Privacy & Security — 10 citations into it
- Information Systems — 9 citations into it; #722 of 8,771 by trust here, #3,540 by citations
Whom Nicolas Gama trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Oded Regev
- Craig Gentry
- Daniele Micciancio
- Zvika Brakerski
- Chris Peikert
- Vinod Vaikuntanathan
- Léo Ducas
- Phong Q. Nguyen
- Panagiotis Voulgaris
- Ravi Kumar
Who trusts Nicolas Gama overall
- Vadim Lyubashevsky
- Chris Peikert
- Richard Lindner
- Yuanmi Chen
- Léo Ducas
- Phong Q. Nguyen
- Martin R. Albrecht
- Tim Erhan Güneysu
- Daniele Micciancio
- Yarkin Doröz
Papers from Nicolas Gama's perspective
Ordered by how strongly the researchers Nicolas Gama trusts endorse each paper. Same corpus, a different order for every researcher.
- Predicting Lattice Reduction (International Conference on the Theory and Application of Cryptographic Techniques)
- On lattices, learning with errors, random linear codes, and cryptography
- On Ideal Lattices and Learning with Errors over Rings
- Trapdoors for hard lattices and new cryptographic constructions
- New lattice based cryptographic constructions
- Fully homomorphic encryption using ideal lattices
- Noise-tolerant learning, the parity problem, and the statistical query model (Symposium on the Theory of Computing)
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller (IACR Cryptology ePrint Archive)
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Better Key Sizes (and Attacks) for LWE-Based Encryption
Their papers
- Predicting Lattice Reduction (2008) — 494 citations
- TFHE: Fast Fully Homomorphic Encryption Over the Torus (2019) — 1,179 citations
- Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds (2016) — 804 citations
- Improving TFHE: faster packed homomorphic operations and efficient circuit bootstrapping (2017) — 38 citations
- New directions in nearest neighbor searching with applications to lattice sieving (2016) — 390 citations
- Lattice Enumeration Using Extreme Pruning (2010) — 313 citations