Mathieu Turuani

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Complexity results for security protocols with Diffie-Hellman exponentiation and commuting public key encryption ACM Transactions on Computational Logic	2017-07-12	Paper
Intruder deducibility constraints with negation. Decidability and application to secured service compositions Journal of Symbolic Computation	2017-02-06	Paper
Intruder deducibility constraints with negation. Decidability and application to secured service compositions Journal of Symbolic Computation	2017-02-06	Paper
Satisfiability of general intruder constraints with and without a set constructor Journal of Symbolic Computation	2017-02-06	Paper
Deciding the security of protocols with commuting public key encryption	2013-09-25	Paper
FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science Lecture Notes in Computer Science	2009-08-06	Paper
The CL-Atse Protocol Analyser Lecture Notes in Computer Science	2008-09-25	Paper
Computer Science Logic Lecture Notes in Computer Science	2007-06-21	Paper
Compositional analysis of contract-signing protocols Theoretical Computer Science	2007-01-09	Paper
Automata, Languages and Programming Lecture Notes in Computer Science	2006-01-10	Paper
An NP decision procedure for protocol insecurity with XOR Theoretical Computer Science	2005-06-30	Paper
Protocol insecurity with a finite number of sessions and composed keys is NP-complete. Theoretical Computer Science	2003-05-25	Paper
scientific article; zbMATH DE number 1903364 (Why is no real title available?)	2003-05-01	Paper

Research outcomes over time

This page was built for person: Mathieu Turuani