( en | de | ru )

 

Disambiguation of "Turuani, Mathieu"

Author of the publication

copydeleteadd this publication to your clipboard
On the Synthesis of Secure Services Composition.

, , , , and . Engineering Secure Future Internet Services and Systems, volume 8431 of Lecture Notes in Computer Science, Springer, (2014)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Theodor Mathieu

Herbert Mathieu

Mathieu Mathias

Herbert Mathieu

Ilse Mathieu

 

Other publications of authors with the same name

Validating Integrity for the Ephemerizer's Protocol with CL-Atse., and . Formal to Practical Security, volume 5458 of Lecture Notes in Computer Science, page 21-32. Springer, (2009)On the Expressivity and Complexity of Quantitative Branching-Time Temporal Logics., , and . LATIN, volume 1776 of Lecture Notes in Computer Science, page 437-446. Springer, (2000)Complexity results for security protocols with Diffie-Hellman exponentiation and commuting public key encryption., , , and . ACM Trans. Comput. Log., 9 (4): 24:1-24:52 (2008)Deciding the Security of Protocols with Commuting Public Key Encryption., , , and . ARSPA@IJCAR, volume 125 of Electronic Notes in Theoretical Computer Science, page 55-66. Elsevier, (2004)The CL-Atse Protocol Analyser.. RTA, volume 4098 of Lecture Notes in Computer Science, page 277-286. Springer, (2006)A Formal Analysis of the Neuchatel e-Voting Protocol., , and . EuroS&P, page 430-442. IEEE, (2018)On the Synthesis of Secure Services Composition., , , , and . Engineering Secure Future Internet Services and Systems, volume 8431 of Lecture Notes in Computer Science, Springer, (2014)Sécurité des protocoles cryptographiques : décidabilité et complexité.. Henri Poincaré University, Nancy, France, (2003)Protocol insecurity with a finite number of sessions, composed keys is NP-complete., and . Theor. Comput. Sci., 299 (1-3): 451-475 (2003)On the expressivity and complexity of quantitative branching-time temporal logics., , and . Theor. Comput. Sci., 297 (1-3): 297-315 (2003)