( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Protocol Insecurity with Finite Number of Sessions is NP-Complete.

, и . CSFW, стр. 174-187. IEEE Computer Society, (2001)

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.

Herbert Mathieu

Herbert Mathieu

Mathieu Mathias

Ilse Mathieu

Bernd Mathieu

 

Другие публикации лиц с тем же именем

Validating Integrity for the Ephemerizer's Protocol with CL-Atse., и . Formal to Practical Security, том 5458 из Lecture Notes in Computer Science, стр. 21-32. Springer, (2009)On the Expressivity and Complexity of Quantitative Branching-Time Temporal Logics., , и . LATIN, том 1776 из Lecture Notes in Computer Science, стр. 437-446. Springer, (2000)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)Deciding the Security of Protocols with Commuting Public Key Encryption., , , и . ARSPA@IJCAR, том 125 из Electronic Notes in Theoretical Computer Science, стр. 55-66. Elsevier, (2004)Sécurité des protocoles cryptographiques : décidabilité et complexité.. Henri Poincaré University, Nancy, France, (2003)The CL-Atse Protocol Analyser.. RTA, том 4098 из Lecture Notes in Computer Science, стр. 277-286. Springer, (2006)A Formal Analysis of the Neuchatel e-Voting Protocol., , и . EuroS&P, стр. 430-442. IEEE, (2018)On the Synthesis of Secure Services Composition., , , , и . Engineering Secure Future Internet Services and Systems, том 8431 из Lecture Notes in Computer Science, Springer, (2014)Protocol insecurity with a finite number of sessions, composed keys is NP-complete., и . Theor. Comput. Sci., 299 (1-3): 451-475 (2003)On the expressivity and complexity of quantitative branching-time temporal logics., , и . Theor. Comput. Sci., 297 (1-3): 297-315 (2003)