Mathieu Turuani

2.8k total citations
20 papers, 277 citations indexed

About

Mathieu Turuani is a scholar working on Computer Networks and Communications, Artificial Intelligence and Information Systems. According to data from OpenAlex, Mathieu Turuani has authored 20 papers receiving a total of 277 indexed citations (citations by other indexed papers that have themselves been cited), including 16 papers in Computer Networks and Communications, 16 papers in Artificial Intelligence and 14 papers in Information Systems. Recurrent topics in Mathieu Turuani's work include Advanced Authentication Protocols Security (16 papers), Cryptography and Data Security (14 papers) and User Authentication and Security Systems (14 papers). Mathieu Turuani is often cited by papers focused on Advanced Authentication Protocols Security (16 papers), Cryptography and Data Security (14 papers) and User Authentication and Security Systems (14 papers). Mathieu Turuani collaborates with scholars based in France, United States and Germany. Mathieu Turuani's co-authors include M. Rusinowitch, Michaël Rusinowitch, Ralf Küsters, Yannick Chevalier, Michael Backes, John C. Mitchell, Ante Đerek, Anupam Datta, François Laroussinie and Ph. Schnoebelen and has published in prestigious journals such as Theoretical Computer Science, Journal of Symbolic Computation and Electronic Notes in Theoretical Computer Science.

In The Last Decade

Mathieu Turuani

19 papers receiving 254 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Mathieu Turuani France 7 233 202 189 55 29 20 277
Nancy Durgin United States 5 261 1.1× 205 1.0× 189 1.0× 82 1.5× 47 1.6× 7 327
Mikael Buchholtz Denmark 6 132 0.6× 99 0.5× 103 0.5× 49 0.9× 13 0.4× 10 173
Daniele Gorla Italy 10 116 0.5× 205 1.0× 59 0.3× 116 2.1× 31 1.1× 39 263
James J. Leifer France 8 108 0.5× 162 0.8× 53 0.3× 58 1.1× 17 0.6× 14 202
Hubert Comon-Lundh France 7 177 0.8× 170 0.8× 149 0.8× 31 0.6× 20 0.7× 14 221
Per Brand Sweden 9 229 1.0× 113 0.6× 58 0.3× 43 0.8× 13 0.4× 26 296
Jesper Bengtson Sweden 10 133 0.6× 269 1.3× 63 0.3× 141 2.6× 17 0.6× 18 303
Pierre-Malo Deniélou United Kingdom 9 132 0.6× 215 1.1× 50 0.3× 104 1.9× 15 0.5× 10 251
Mohamed Mejri Canada 9 117 0.5× 126 0.6× 108 0.6× 14 0.3× 28 1.0× 52 187
Santiago Escobar Spain 10 117 0.5× 277 1.4× 94 0.5× 183 3.3× 8 0.3× 63 340

Countries citing papers authored by Mathieu Turuani

Since Specialization
Citations

This map shows the geographic impact of Mathieu Turuani'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 Mathieu Turuani with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Mathieu Turuani more than expected).

Fields of papers citing papers by Mathieu Turuani

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Mathieu Turuani. 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 Mathieu Turuani. The network helps show where Mathieu Turuani may publish in the future.

Co-authorship network of co-authors of Mathieu Turuani

This figure shows the co-authorship network connecting the top 25 collaborators of Mathieu Turuani. A scholar is included among the top collaborators of Mathieu Turuani 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 Mathieu Turuani. Mathieu Turuani is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Chabanne, Hervé, Véronique Cortier, Emmanuelle Dottax, et al.. (2022). Themis. Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security. 397–410. 3 indexed citations
2.
Chevalier, Yannick, et al.. (2016). Intruder deducibility constraints with negation. Decidability and application to secured service compositions. Journal of Symbolic Computation. 80. 4–26. 2 indexed citations
3.
Chevalier, Yannick, et al.. (2016). Satisfiability of general intruder constraints with and without a set constructor. Journal of Symbolic Computation. 80. 27–61. 1 indexed citations
4.
Cortier, Véronique, Jérémie Detrey, Pierrick Gaudry, et al.. (2011). Ballot stuffing in a postal voting system. HAL (Le Centre pour la Communication Scientifique Directe). 27–36. 3 indexed citations
5.
Chevalier, Yannick, et al.. (2010). Satisfiability of general intruder constraints with a set constructor. Open Repository and Bibliography (University of Luxembourg). 4720. 1–8. 1 indexed citations
6.
Turuani, Mathieu, et al.. (2009). Decidable Analysis for a Class of Cryptographic Group Protocols with Unbounded Lists. 277–289. 6 indexed citations
7.
Turuani, Mathieu, et al.. (2008). Towards a Constrained-based Verification of Parameterized Cryptographic Protocols. HAL (Le Centre pour la Communication Scientifique Directe). 191–206. 1 indexed citations
8.
Chevalier, Yannick, Ralf Küsters, Michaël Rusinowitch, & Mathieu Turuani. (2008). Complexity results for security protocols with Diffie-Hellman exponentiation and commuting public key encryption. ACM Transactions on Computational Logic. 9(4). 1–52. 7 indexed citations
9.
Turuani, Mathieu, et al.. (2008). Constraints-based Verification of Parameterized Cryptographic Protocols.. HAL (Le Centre pour la Communication Scientifique Directe). 54. 2 indexed citations
10.
Backes, Michael, Anupam Datta, Ante Đerek, John C. Mitchell, & Mathieu Turuani. (2006). Compositional analysis of contract-signing protocols. Theoretical Computer Science. 367(1-2). 33–56. 13 indexed citations
11.
Küsters, Ralf, et al.. (2006). Implementing a Unification Algorithm for Protocol Analysis with XOR. arXiv (Cornell University). 1–5. 1 indexed citations
12.
Turuani, Mathieu, et al.. (2006). Adding Integrity to the Ephemerizer's Protocol. HAL (Le Centre pour la Communication Scientifique Directe). 146–151. 2 indexed citations
13.
Chevalier, Yannick, Ralf Küsters, Michaël Rusinowitch, & Mathieu Turuani. (2005). An NP decision procedure for protocol insecurity with XOR. Theoretical Computer Science. 338(1-3). 247–274. 16 indexed citations
14.
Chevalier, Yannick, Ralf Küsters, Michaël Rusinowitch, & Mathieu Turuani. (2005). Deciding the Security of Protocols with Commuting Public Key Encryption. Electronic Notes in Theoretical Computer Science. 125(1). 55–66. 11 indexed citations
15.
Rusinowitch, M. & Mathieu Turuani. (2005). Protocol insecurity with finite number of sessions is NP-complete. HAL (Le Centre pour la Communication Scientifique Directe). 174–187. 71 indexed citations
16.
Backes, Michael, Anupam Datta, Ante Đerek, John C. Mitchell, & Mathieu Turuani. (2005). Compositional Analysis of Contract Signing Protocols. 175. 94–110. 6 indexed citations
17.
Chevalier, Yannick, Ralf Küsters, Michaël Rusinowitch, & Mathieu Turuani. (2004). Deciding the Security of Protocols with Commuting Public Key Encryption.. HAL (Le Centre pour la Communication Scientifique Directe). 78. 1 indexed citations
18.
Rusinowitch, Michaël & Mathieu Turuani. (2003). Protocol insecurity with a finite number of sessions and composed keys is NP-complete. Theoretical Computer Science. 299(1-3). 451–475. 62 indexed citations
19.
Laroussinie, François, Ph. Schnoebelen, & Mathieu Turuani. (2003). On the expressivity and complexity of quantitative branching-time temporal logics. Theoretical Computer Science. 297(1-3). 297–315. 6 indexed citations
20.
Chevalier, Yannick, Ralf Küsters, M. Rusinowitch, & Mathieu Turuani. (2003). An NP decision procedure for protocol insecurity with XOR. 261–270. 62 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