Tancrède Lepoint

Artificial Intelligence · 2013–2020

A researcher in the Science corpus: 12 papers; trusts 45 researchers and is trusted by 25 researchers here, as inferred from the citation graph.

Subfields

• Artificial Intelligence — 532 citations into it; #8,138 of 35,345 by trust here, #2,817 by citations
• Privacy & Security — 252 citations into it; #480 of 709 by trust here, #503 by citations
• Computational Theory and Mathematics — 123 citations into it; #2,130 of 12,182 by trust here, #1,352 by citations
• Computer Vision and Pattern Recognition — 73 citations into it
• Computer Networks and Communications — 64 citations into it
• Information Systems — 51 citations into it; #3,262 of 8,771 by trust here, #2,604 by citations
• Algorithms & Complexity — 22 citations into it
• Mathematical Optimization — 14 citations into it

Whom Tancrède Lepoint trusts overall

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

1. Craig Gentry
2. Zvika Brakerski
3. Vadim Lyubashevsky
4. Pascal Paillier
5. Oded Goldreich
6. Chris Peikert
7. Oded Regev
8. Benny Pinkas
9. Hao Chen
10. Vinod Vaikuntanathan

Who trusts Tancrède Lepoint overall

1. Ilaria Chillotti
2. Jung Hee Cheon
3. Daniel J. Bernstein
4. Abbas Acar
5. Nicolas Gama
6. Shai Halevi
7. Sanjam Garg
8. Léo Ducas
9. Boaz Barak
10. Chris Peikert

Papers from Tancrède Lepoint's perspective

Ordered by how strongly the researchers Tancrède Lepoint trusts endorse each paper. Same corpus, a different order for every researcher.

1. Fully homomorphic encryption using ideal lattices
2. On Ideal Lattices and Learning with Errors over Rings
3. Random oracles are practical: a paradigm for designing efficient protocols
4. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
5. Private information retrieval
6. Predicting Lattice Reduction (International Conference on the Theory and Application of Cryptographic Techniques)
7. A fully homomorphic encryption scheme
8. Efficient Fully Homomorphic Encryption from (Standard) LWE
9. Trapdoors for hard lattices and new cryptographic constructions
10. Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP

Their papers

• Advances and Open Problems in Federated Learning (2019) — 9,019 citations
• Practical Multilinear Maps over the Integers (2013) — 435 citations
• Scale-Invariant Fully Homomorphic Encryption over the Integers (2014) — 199 citations
• Lattice Signatures and Bimodal Gaussians (2013) — 638 citations
• Batch Fully Homomorphic Encryption over the Integers (2013) — 376 citations
• Cryptanalysis of a (Somewhat) Additively Homomorphic Encryption Scheme Used in PIR (2015) — 14 citations
• CRYSTALS - Kyber: A CCA-Secure Module-Lattice-Based KEM (2017) — 1,190 citations
• Secure Single-Server Aggregation with (Poly)Logarithmic Overhead (2020) — 580 citations
• Private Join and Compute from PIR with Default (2020) — 37 citations
• Communication-Computation Trade-offs in PIR (2019) — 130 citations
• CRYSTALS-Dilithium: A Lattice-Based Digital Signature Scheme (2018) — 826 citations
• Will Distributed Computing Revolutionize Peace? The Emergence of Battlefield IoT (2018) — 34 citations