The CL-atse protocol analyser

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4098 LNCS, Issue , 2006, Pages 277-286

  Turuani, Mathieu ^a  

^a LORIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; ALGORITHMS; COMPUTER SIMULATION; CONSTRAINT THEORY; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; NETWORK PROTOCOLS; PROBLEM SOLVING; SECURITY OF DATA;

CRYPTOGRAPHIC PROTOCOLS; EXPONENTIATION; PROTOCOL ANALYSERS; UNIFICATION ALGORITHMS;

CRYPTOGRAPHY;

EID: 33749413267     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11805618_21     Document Type: Conference Paper

References (16)

1. R. Amadio, D. Lugiez, and V. Vanackère. On the symbolic reduction of processes with cryptographic functions. Theor. Comput. Sci., 290(1):695-740, 2003.
2. The AVISPA Team. The Avispa Tool for the automated validation of internet security protocols and applications. In Proceedings of CAV2005, Computer Aided Verification, LNCS 3576, Springer Verlag.
3. A. Armando, L. Compagna. An Optimized Intruder Model for SAT-based Model-Checking of Security Protocols. In Proceedings of the Workshop on Automated Reasoning for Security Protocol Analysis (ARSPA 2004), ENTCS 125(1):91-108, 2005.
4. F. Baader and K.U. Schulz. Unification in the Union of Disjoint Equational Theories: Combining Decision Procedures. In Journal of Symbolic Computing. 21(2): 211-243 (1996).
5. D. Basin, S. Mödersheim, L. Viganò. OFMC: A symbolic model checker for security protocols. In International Journal of Information Security 4(3):181-208, 2005.
6. Y. Boichut, P.-C. Héam, O. Kouchnarenko. Automatic Verification of Security Protocols Using Approximations. INRIA Research Report, October 2005.
7. M. Boreale. Symbolic trace analysis of cryptographic protocols. In Proceedings of the 28th ICALP'01, LNCS 2076, pages 667-681. Springer-Verlag, Berlin, 2001.
8. Y. Chevalier, R. Küsters, M. Rusinowitch, and M. Turuani. An NP decision procedure for protocol insecurity with xor. In Proceedings of LICS 2003, 2003.
9. Y. Chevalier, R. Küsters, M. Rusinowitch, and M. Turuani. Deciding the Security of Protocols with Diffie-Hellman Exponentiation and Products in Exponents. In Proceedings of the Foundations of Software Technology and Theoretical Computer Science (FSTTCS'03), LNCS 2914, Springer-Verlag, December 2003.
10. Y. Chevalier and L. Vigneron. A Tool for Lazy Verification of Security Protocols. In Proceedings of the Automated Software Engineering Conference (ASE'01). IEEE CSP, 2001.
11. J. Clark and J. Jacob. A Survey of Authentication Protocol Literature: Version 1.0, 17. Nov. 1997. URL: www.cs.york.ac.uk/~jac/papers/drareview.ps.gz.
12. R. Corin and S. Etalle. An improved constraint-based system for the verification of security protocols. In SAS, LNCS 2477:326-341, Springer-Verlag, 2002.
13. D. Dolev and A.C. Yao. On the Security of Public-Key Protocols. IEEE Transactions on Information Theory, 29(2): 198-208, 1983.
14. C. Meadows. Open issues in formal methods for cryptographic protocol analysis. In Proceedings of DISCEX 2000, pages 237-250. IEEE Computer Society Press, 2000.
15. J. Millen and V. Shmatikov. Symbolic protocol analysis with products and Diffie-Hellman exponentiation. In Proceedings of the 16th IEEE Computer Security Foundations Workshop (CSFW'03), pages 47-61, 2003.
16. M. Rusinowitch and M. Turuani. Protocol Insecurity with Finite Number of Sessions is NP-complete. In 14th IEEE Computer Security Foundations Workshop (CSFW-14), pages 174-190, 2001.