Comparison of cryptographic verification tools dealing with algebraic properties

22Citations
Citations of this article
20Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Recently Kuesters et al proposed two new methods using ProVerif for analyzing cryptographic protocols with Exclusive-Or and Diffie-Hellman properties. Some tools, for instance CL-Atse and OFMC, are able to deal with Exclusive-Or and Diffie-Hellman. In this article we compare time efficiency of these tools verifying some protocols of the litterature that are designed with such algebraic properties. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Lafourcade, P., Terrade, V., & Vigier, S. (2010). Comparison of cryptographic verification tools dealing with algebraic properties. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5983 LNCS, pp. 173–185). https://doi.org/10.1007/978-3-642-12459-4_13

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free