Adeline Langlois

Artificial Intelligence · 2013–2014

A researcher in the Science corpus: 3 papers; trusts 26 researchers and is trusted by 11 researchers here, as inferred from the citation graph.

Subfields

• Artificial Intelligence — 57 citations into it; #13,358 of 35,345 by trust here, #15,866 by citations
• Computational Theory and Mathematics — 41 citations into it; #10,861 of 12,182 by trust here, #8,756 by citations
• Information Systems — 11 citations into it
• Computer Vision and Pattern Recognition — 8 citations into it
• Computer Networks and Communications — 6 citations into it
• Privacy & Security — 5 citations into it

Whom Adeline Langlois trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Daniele Micciancio
2. Oded Regev
3. Chris Peikert
4. Craig Gentry
5. Vadim Lyubashevsky
6. Amit Sahai
7. Damien Stehlé
8. Dan Boneh
9. Vinod Vaikuntanathan
10. Adriana López-Alt

Who trusts Adeline Langlois overall

1. Joppe W. Bos
2. Léo Ducas
3. Chris Peikert
4. Ilaria Chillotti
5. Daniele Micciancio
6. Vadim Lyubashevsky
7. Martin R. Albrecht
8. Nicolas Gama
9. Eike Kiltz

Papers from Adeline Langlois's perspective

Ordered by how strongly the researchers Adeline Langlois trusts endorse each paper. Same corpus, a different order for every researcher.

1. Trapdoors for hard lattices and new cryptographic constructions
2. On lattices, learning with errors, random linear codes, and cryptography
3. Lossy trapdoor functions and their applications (SIAM journal on computing (Print))
4. On Ideal Lattices and Learning with Errors over Rings
5. Collision-Free Hashing from Lattice Problems
6. Lattice Signatures Without Trapdoors (IACR Cryptology ePrint Archive)
7. New lattice based cryptographic constructions
8. Public-key cryptosystems from the worst-case shortest vector problem: extended abstract (Symposium on the Theory of Computing)
9. Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
10. Fully homomorphic encryption using ideal lattices

Their papers

• Worst-case to average-case reductions for module lattices (2014) — 717 citations
• GGHLite: More Efficient Multilinear Maps from Ideal Lattices (2014) — 182 citations
• Classical hardness of learning with errors (2013) — 743 citations