Mathieu Turuani

According to our database1, Mathieu Turuani authored at least 32 papers between 2001 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Themis: An On-Site Voting System with Systematic Cast-as-intended Verification and Partial Accountability.
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022

2018
Verifiability Analysis of CHVote.
IACR Cryptol. ePrint Arch., 2018

A Formal Analysis of the Neuchatel e-Voting Protocol.
Proceedings of the 2018 IEEE European Symposium on Security and Privacy, 2018

A Little More Conversation, a Little Less Action, a Lot More Satisfaction: Global States in ProVerif.
Proceedings of the 31st IEEE Computer Security Foundations Symposium, 2018

2017
Satisfiability of general intruder constraints with and without a set constructor.
J. Symb. Comput., 2017

Intruder deducibility constraints with negation. Decidability and application to secured service compositions.
J. Symb. Comput., 2017

2016
Automated Verification of Electrum Wallet.
Proceedings of the Financial Cryptography and Data Security, 2016

2014
On the Synthesis of Secure Services Composition.
Proceedings of the Engineering Secure Future Internet Services and Systems, 2014

2012
The AVANTSSAR Platform for the Automated Validation of Trust and Security of Service-Oriented Architectures.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2012

Towards the Orchestration of Secured Services under Non-disclosure Policies.
Proceedings of the Computer Network Security, 2012

2011
Ballot stuffing in a postal voting system.
Proceedings of the 2011 International Workshop on Requirements Engineering for Electronic Voting Systems, 2011

Towards Formal Validation of Trust and Security in the Internet of Services.
Proceedings of the Future Internet, 2011

Distributed Orchestration of Web Services under Security Constraints.
Proceedings of the Data Privacy Management and Autonomous Spontaneus Security, 2011

Verifying a bounded number of sessions and its complexity.
Proceedings of the Formal Models and Techniques for Analyzing Security Protocols, 2011

2010
Satisfiability of general intruder constraints with a set constructor.
Proceedings of the CRiSIS 2010, 2010

2009
Validating Integrity for the Ephemerizer's Protocol with CL-Atse.
Proceedings of the Formal to Practical Security, 2009

Decidable Analysis for a Class of Cryptographic Group Protocols with Unbounded Lists.
Proceedings of the 22nd IEEE Computer Security Foundations Symposium, 2009

2008
Complexity results for security protocols with Diffie-Hellman exponentiation and commuting public key encryption.
ACM Trans. Comput. Log., 2008

2006
Compositional analysis of contract-signing protocols.
Theor. Comput. Sci., 2006

Implementing a Unification Algorithm for Protocol Analysis with XOR
CoRR, 2006

The CL-Atse Protocol Analyser.
Proceedings of the Term Rewriting and Applications, 17th International Conference, 2006

2005
An NP decision procedure for protocol insecurity with XOR.
Theor. Comput. Sci., 2005

Probabilistic Polynomial-Time Semantics for a Protocol Security Logic.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

The AVISPA Tool for the Automated Validation of Internet Security Protocols and Applications.
Proceedings of the Computer Aided Verification, 17th International Conference, 2005

2004
Deciding the Security of Protocols with Commuting Public Key Encryption.
Proceedings of the Workshop on Automated Reasoning for Security Protocol Analysis, 2004

2003
Sécurité des protocoles cryptographiques : décidabilité et complexité.
PhD thesis, 2003

Protocol insecurity with a finite number of sessions, composed keys is NP-complete.
Theor. Comput. Sci., 2003

On the expressivity and complexity of quantitative branching-time temporal logics.
Theor. Comput. Sci., 2003

Deciding the Security of Protocols with Diffie-Hellman Exponentiation and Products in Exponents.
Proceedings of the FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 2003

Extending the Dolev-Yao Intruder for Analyzing an Unbounded Number of Sessions.
Proceedings of the Computer Science Logic, 17th International Workshop, 2003

2002
The AVISS Security Protocol Analysis Tool.
Proceedings of the Computer Aided Verification, 14th International Conference, 2002

2001
Protocol Insecurity with Finite Number of Sessions is NP-Complete.
Proceedings of the 14th IEEE Computer Security Foundations Workshop (CSFW-14 2001), 2001


  Loading...