Thomas Espitau

768 total citations
13 papers, 70 citations indexed

About

Thomas Espitau is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Thomas Espitau has authored 13 papers receiving a total of 70 indexed citations (citations by other indexed papers that have themselves been cited), including 12 papers in Artificial Intelligence, 6 papers in Computational Theory and Mathematics and 3 papers in Computer Networks and Communications. Recurrent topics in Thomas Espitau's work include Cryptography and Data Security (8 papers), Cryptographic Implementations and Security (4 papers) and Bayesian Modeling and Causal Inference (2 papers). Thomas Espitau is often cited by papers focused on Cryptography and Data Security (8 papers), Cryptographic Implementations and Security (4 papers) and Bayesian Modeling and Causal Inference (2 papers). Thomas Espitau collaborates with scholars based in France, Japan and Spain. Thomas Espitau's co-authors include Gilles Barthe, Justin Hsu, Pierre-Yves Strub, Mehdi Tibouchi, Benjamin Grégoire, Pierre-Alain Fouque, Sonia Belaïd, Benoît Gérard, Mélissa Rossi and Masayuki Abe and has published in prestigious journals such as SHILAP Revista de lepidopterología, IEEE Transactions on Computers and Journal of Cryptology.

In The Last Decade

Thomas Espitau

11 papers receiving 70 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Thomas Espitau France 5 61 13 13 10 7 13 70
Baptiste Rozière United States 5 39 0.6× 10 0.8× 15 1.2× 8 0.8× 7 1.0× 7 73
Simona Samardjiska Netherlands 5 78 1.3× 19 1.5× 15 1.2× 17 1.7× 9 1.3× 10 93
Xavier Bonnetain France 3 83 1.4× 30 2.3× 12 0.9× 9 0.9× 6 0.9× 8 93
Daniel Apon United States 4 70 1.1× 13 1.0× 11 0.8× 18 1.8× 13 1.9× 7 80
Alex J. Malozemoff United States 8 73 1.2× 10 0.8× 14 1.1× 19 1.9× 11 1.6× 11 88
Johannes Oetsch Austria 6 63 1.0× 6 0.5× 15 1.2× 6 0.6× 8 1.1× 22 89
Yan Zong Ding United States 3 54 0.9× 31 2.4× 15 1.2× 7 0.7× 10 1.4× 5 66
Shien Jin Ong United States 3 75 1.2× 15 1.2× 33 2.5× 9 0.9× 8 1.1× 5 82
Arpita Patra India 5 107 1.8× 11 0.8× 17 1.3× 25 2.5× 10 1.4× 19 121
Marion Videau France 3 81 1.3× 12 0.9× 21 1.6× 4 0.4× 8 1.1× 5 93

Countries citing papers authored by Thomas Espitau

Since Specialization
Citations

This map shows the geographic impact of Thomas Espitau's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Thomas Espitau with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Thomas Espitau more than expected).

Fields of papers citing papers by Thomas Espitau

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Thomas Espitau. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Thomas Espitau. The network helps show where Thomas Espitau may publish in the future.

Co-authorship network of co-authors of Thomas Espitau

This figure shows the co-authorship network connecting the top 25 collaborators of Thomas Espitau. A scholar is included among the top collaborators of Thomas Espitau based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Thomas Espitau. Thomas Espitau is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

13 of 13 papers shown
1.
Barthe, Gilles, Sonia Belaïd, Thomas Espitau, et al.. (2023). Masking the GLP Lattice-Based Signature Scheme at Any Order. Journal of Cryptology. 37(1).
2.
Espitau, Thomas, et al.. (2021). Guessing Bits: Improved Lattice Attacks on (EC)DSA with Nonce Leakage. IACR Transactions on Cryptographic Hardware and Embedded Systems. 391–413. 6 indexed citations
4.
Joux, Antoine & Thomas Espitau. (2020). Certified Lattice Reduction. Figshare.
5.
Espitau, Thomas & Paul Kirchner. (2020). The nearest-colattice algorithm: Time-approximation tradeoff for approx-CVP. 4(1). 251–266. 2 indexed citations
6.
Barthe, Gilles, et al.. (2019). Relational $\star$-Liftings for Differential Privacy. SHILAP Revista de lepidopterología. 2 indexed citations
7.
Barthe, Gilles, Sonia Belaïd, Thomas Espitau, et al.. (2019). GALACTICS. 2147–2164. 15 indexed citations
8.
Barthe, Gilles, Thomas Espitau, Benjamin Grégoire, Justin Hsu, & Pierre-Yves Strub. (2018). Proving uniformity and independence by self-composition and coupling. EPiC series in computing. 46. 385–365. 2 indexed citations
9.
Espitau, Thomas, Pierre-Alain Fouque, Benoît Gérard, & Mehdi Tibouchi. (2018). Loop-Abort Faults on Lattice-Based Signatures and Key Exchange Protocols. IEEE Transactions on Computers. 1–1. 11 indexed citations
10.
Barthe, Gilles, Thomas Espitau, Benjamin Grégoire, Justin Hsu, & Pierre-Yves Strub. (2017). Proving uniformity and independence by self-composition and coupling. arXiv (Cornell University). 6 indexed citations
11.
Barthe, Gilles, Thomas Espitau, Benjamin Grégoire, Justin Hsu, & Pierre-Yves Strub. (2017). Proving expected sensitivity of probabilistic programs. Proceedings of the ACM on Programming Languages. 2(POPL). 1–29. 20 indexed citations
12.
Barthe, Gilles, et al.. (2017). Liftings for Differential Privacy. HAL (Le Centre pour la Communication Scientifique Directe). 2 indexed citations
13.
Barthe, Gilles, Thomas Espitau, Benjamin Grégoire, Justin Hsu, & Pierre-Yves Strub. (2017). Proving Expected Sensitivity of Probabilistic Programs. arXiv (Cornell University). 3 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026