default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathieu Turuani
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c24]Ludovic Paillat
, Claudia-Lavinia Ignat, Davide Frey, Mathieu Turuani, Amine Ismail:
Design of an Efficient Distributed Delivery Service for Group Key Agreement Protocols. FPS (1) 2023: 408-423- 2022
- [c23]Mikael Bougon, Hervé Chabanne, Véronique Cortier, Alexandre Debant, Emmanuelle Dottax, Jannik Dreier, Pierrick Gaudry, Mathieu Turuani:
Themis: An On-Site Voting System with Systematic Cast-as-intended Verification and Partial Accountability. CCS 2022: 397-410
2010 – 2019
- 2018
- [c22]Vincent Cheval, Véronique Cortier, Mathieu Turuani:
A Little More Conversation, a Little Less Action, a Lot More Satisfaction: Global States in ProVerif. CSF 2018: 344-358 - [c21]Véronique Cortier, David Galindo, Mathieu Turuani:
A Formal Analysis of the Neuchatel e-Voting Protocol. EuroS&P 2018: 430-442 - [i4]David Bernhard, Véronique Cortier, Pierrick Gaudry, Mathieu Turuani, Bogdan Warinschi:
Verifiability Analysis of CHVote. IACR Cryptol. ePrint Arch. 2018: 1052 (2018) - 2017
- [j7]Tigran Avanesov, Yannick Chevalier, Michaël Rusinowitch, Mathieu Turuani:
Intruder deducibility constraints with negation. Decidability and application to secured service compositions. J. Symb. Comput. 80: 4-26 (2017) - [j6]Tigran Avanesov, Yannick Chevalier, Michaël Rusinowitch, Mathieu Turuani:
Satisfiability of general intruder constraints with and without a set constructor. J. Symb. Comput. 80: 27-61 (2017) - 2016
- [c20]Mathieu Turuani, Thomas Voegtlin, Michaël Rusinowitch:
Automated Verification of Electrum Wallet. Financial Cryptography Workshops 2016: 27-42 - 2014
- [p2]José Antonio Martín, Fabio Martinelli, Ilaria Matteucci, Ernesto Pimentel, Mathieu Turuani:
On the Synthesis of Secure Services Composition. Engineering Secure Future Internet Services and Systems 2014: 140-159 - 2012
- [c19]Tigran Avanesov, Yannick Chevalier, Michaël Rusinowitch, Mathieu Turuani:
Towards the Orchestration of Secured Services under Non-disclosure Policies. MMM-ACNS 2012: 130-145 - [c18]Alessandro Armando, Wihem Arsac, Tigran Avanesov, Michele Barletta, Alberto Calvi, Alessandro Cappai, Roberto Carbone, Yannick Chevalier, Luca Compagna, Jorge Cuéllar, Gabriel Erzse, Simone Frau, Marius Minea, Sebastian Mödersheim, David von Oheimb, Giancarlo Pellegrino, Serena Elisa Ponta, Marco Rocchetto, Michaël Rusinowitch, Mohammad Torabi Dashti, Mathieu Turuani, Luca Viganò:
The AVANTSSAR Platform for the Automated Validation of Trust and Security of Service-Oriented Architectures. TACAS 2012: 267-282 - [i3]Tigran Avanesov, Yannick Chevalier, Michaël Rusinowitch, Mathieu Turuani:
Intruder deducibility constraints with negation. Decidability and application to secured service compositions. CoRR abs/1207.4871 (2012) - 2011
- [c17]Tigran Avanesov, Yannick Chevalier, Mohammed Anis Mekki, Michaël Rusinowitch, Mathieu Turuani:
Distributed Orchestration of Web Services under Security Constraints. DPM/SETOP 2011: 235-252 - [c16]Roberto Carbone, Marius Minea, Sebastian Mödersheim, Serena Elisa Ponta, Mathieu Turuani, Luca Viganò:
Towards Formal Validation of Trust and Security in the Internet of Services. Future Internet Assembly 2011: 193-208 - [c15]Véronique Cortier, Jérémie Detrey, Pierrick Gaudry, Frédéric Sur, Emmanuel Thomé, Mathieu Turuani, Paul Zimmermann:
Ballot stuffing in a postal voting system. REVOTE 2011: 27-36 - [p1]Michaël Rusinowitch, Mathieu Turuani:
Verifying a bounded number of sessions and its complexity. Formal Models and Techniques for Analyzing Security Protocols 2011: 13-34 - [i2]Tigran Avanesov, Yannick Chevalier, Michaël Rusinowitch, Mathieu Turuani:
Satisfiability of General Intruder Constraints with and without a Set Constructor. CoRR abs/1103.0220 (2011) - 2010
- [c14]Tigran Avanesov, Yannick Chevalier, Michaël Rusinowitch, Mathieu Turuani:
Satisfiability of general intruder constraints with a set constructor. CRiSIS 2010: 1-8
2000 – 2009
- 2009
- [c13]Najah Chridi, Mathieu Turuani, Michaël Rusinowitch:
Decidable Analysis for a Class of Cryptographic Group Protocols with Unbounded Lists. CSF 2009: 277-289 - [c12]Charu Arora, Mathieu Turuani:
Validating Integrity for the Ephemerizer's Protocol with CL-Atse. Formal to Practical Security 2009: 21-32 - 2008
- [j5]Yannick Chevalier, Ralf Küsters, Michaël Rusinowitch, Mathieu Turuani:
Complexity results for security protocols with Diffie-Hellman exponentiation and commuting public key encryption. ACM Trans. Comput. Log. 9(4): 24:1-24:52 (2008) - 2006
- [j4]Michael Backes, Anupam Datta, Ante Derek, John C. Mitchell, Mathieu Turuani:
Compositional analysis of contract-signing protocols. Theor. Comput. Sci. 367(1-2): 33-56 (2006) - [c11]Mathieu Turuani:
The CL-Atse Protocol Analyser. RTA 2006: 277-286 - [i1]Max Tuengerthal, Ralf Küsters, Mathieu Turuani:
Implementing a Unification Algorithm for Protocol Analysis with XOR. CoRR abs/cs/0610014 (2006) - 2005
- [j3]Yannick Chevalier, Ralf Küsters, Michaël Rusinowitch, Mathieu Turuani:
An NP decision procedure for protocol insecurity with XOR. Theor. Comput. Sci. 338(1-3): 247-274 (2005) - [c10]Alessandro Armando, David A. Basin, Yohan Boichut, Yannick Chevalier, Luca Compagna, Jorge Cuéllar, Paul Hankes Drielsma, Pierre-Cyrille Héam, Olga Kouchnarenko, Jacopo Mantovani, Sebastian Mödersheim, David von Oheimb, Michaël Rusinowitch, Judson Santiago, Mathieu Turuani, Luca Viganò, Laurent Vigneron:
The AVISPA Tool for the Automated Validation of Internet Security Protocols and Applications. CAV 2005: 281-285 - [c9]Michael Backes, Anupam Datta, Ante Derek, John C. Mitchell, Mathieu Turuani:
Compositional Analysis of Contract Signing Protocols. CSFW 2005: 94-110 - [c8]Anupam Datta, Ante Derek, John C. Mitchell, Vitaly Shmatikov, Mathieu Turuani:
Probabilistic Polynomial-Time Semantics for a Protocol Security Logic. ICALP 2005: 16-29 - 2004
- [c7]Yannick Chevalier, Ralf Küsters, Michaël Rusinowitch, Mathieu Turuani:
Deciding the Security of Protocols with Commuting Public Key Encryption. ARSPA@IJCAR 2004: 55-66 - 2003
- [b1]Mathieu Turuani:
Sécurité des protocoles cryptographiques : décidabilité et complexité. Henri Poincaré University, Nancy, France, 2003 - [j2]François Laroussinie, Philippe Schnoebelen, Mathieu Turuani:
On the expressivity and complexity of quantitative branching-time temporal logics. Theor. Comput. Sci. 297(1-3): 297-315 (2003) - [j1]Michaël Rusinowitch, Mathieu Turuani:
Protocol insecurity with a finite number of sessions, composed keys is NP-complete. Theor. Comput. Sci. 299(1-3): 451-475 (2003) - [c6]Yannick Chevalier, Ralf Küsters, Michaël Rusinowitch, Mathieu Turuani, Laurent Vigneron:
Extending the Dolev-Yao Intruder for Analyzing an Unbounded Number of Sessions. CSL 2003: 128-141 - [c5]Yannick Chevalier, Ralf Küsters, Michaël Rusinowitch, Mathieu Turuani:
Deciding the Security of Protocols with Diffie-Hellman Exponentiation and Products in Exponents. FSTTCS 2003: 124-135 - [c4]Yannick Chevalier, Ralf Küsters, Michaël Rusinowitch, Mathieu Turuani:
An NP Decision Procedure for Protocol Insecurity with XOR. LICS 2003: 261-270 - 2002
- [c3]Alessandro Armando, David A. Basin, Mehdi Bouallagui, Yannick Chevalier, Luca Compagna, Sebastian Mödersheim, Michaël Rusinowitch, Mathieu Turuani, Luca Viganò, Laurent Vigneron:
The AVISS Security Protocol Analysis Tool. CAV 2002: 349-353 - 2001
- [c2]Michaël Rusinowitch, Mathieu Turuani:
Protocol Insecurity with Finite Number of Sessions is NP-Complete. CSFW 2001: 174-187 - 2000
- [c1]François Laroussinie, Philippe Schnoebelen, Mathieu Turuani:
On the Expressivity and Complexity of Quantitative Branching-Time Temporal Logics. LATIN 2000: 437-446
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
