Automated unbounded verification of security protocols

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

Volumn 2404, Issue , 2002, Pages 324-337

  Chevalier, Yannick ^a   Vigneron, Laurent ^a  

^a LORIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED ANALYSIS;

AUTOMATED VERIFICATION; ITS EFFICIENCIES; SECURITY PROTOCOLS; SYMMETRIC KEYS;

NETWORK SECURITY;

EID: 84937559950     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45657-0_24     Document Type: Conference Paper

References (19)

1. R. Amadio and D. Lugiez. On the reachability problem in cryptographic protocols. In CONCUR’2000, pages 380–394, 2000.
2. A. Armando, D. Basin, M. Bouallagui, Y. Chevalier, L. Compagna, S. Mödersheim, M. Rusinowitch, M. Turuani, L. Vigano, and L. Vigneron. The AVISS Security Protocol Analysis Tool. In CAV’02, 2002. Tool presentation.
3. D. Basin. Lazy Infinite-State Analysis of Security Protocols. In R. Baumgart, editor, Secure Networking — CQRE (Secure)’99, LNCS 1740, pages 30–42, Heidelberg, Germany, 1999. Springer-Verlag.
4. B. Blanchet. An Efficient Cryptographic Protocol Verifier Based on Prolog Rules. In 14th IEEE Computer Security Foundations Workshop, June 2001.
5. Y. Chevalier and L. Vigneron. Towards Efficient Automated Verification of Security Protocols. In Verification Workshop (VERIFY’01) (in connection with IJCAR’01), Università degli studi di Siena, TR DII 08/01, pages 19–33, 2001.
6. Y. Chevalier and L. Vigneron. Automated Unbounded Verification of Security Protocols. Research Report 4369, Institut National de Recherche en Informatique et Automatique, Nancy (France), January 2002.
7. J. Clark and J. Jacob. A Survey of Authentication Protocol Literature: Version 1.0, 17 Nov. 1997. URL http://www.cs.york.ac.uk/~jac/papers/drareview.ps.gz.
8. H. Comon, V. Cortier, and J. Mitchell. Tree Automata with one Memory, Set Constraints and Ping-Pong Protocols. In 28th Int. Coll. Automata, Languages, and Programming (ICALP’2001), LNCS 2076, pages 682–693. Springer, 2001.
9. B. Donovan, P. Norris, and G. Lowe. Analyzing a Library of Security Protocols using Casper and FDR. In W. on Formal Methods and Security Protocols, 1999.
10. N. Durgin, P. Lincoln, J. Mitchell, and A. Scedrov. Undecidability of Bounded Security Protocols. In FLOC’99 Workshop on Formal Methods and Sec. Protocols (FMSP’99), 1999.
11. J. Goubault-Larrecq. A Method for Automatic Cryptographic Protocol Verification. In IPDPS 2000 Workshops, Cancun, Mexico, LNCS 1800, pages 977–984. Springer, May 2000.
12. F. Jacquemard, M. Rusinowitch, and L. Vigneron. Compiling and Verifying Security Protocols. In M. Parigot and A. Voronkov, editors, Proceedings of LPAR’2000, LNCS 1955, pages 131–160, Heidelberg, 2000. Springer-Verlag.
13. G. Lowe. Towards a Completeness Result for Model Checking of Security Protocols. Journal of Computer Security 7, 1, 1999.
14. J. Millen and V. Shmatikov. Constraint Solving for Bounded-Process Cryptographic Protocol Analysis. In 8th ACM Conference on Computer and Communication Security, pages 166–175, November 2001.
15. D. Monniaux. Abstracting Cryptographic Protocols with Tree Automata. In 6th Int. Static Analysis Symposium (SAS’99), LNCS 1694. Springer-Verlag, 1999.
16. M. Rusinowitch and M. Turuani. Protocol Insecurity with Finite Number of Sessions is NP-complete. In Proceedings of the 14th IEEE Computer Security Foundations Workshop. IEEE Computer Society Press, 2001.
17. D. Song, S. Berezin, and A. Perrig. Athena, a Novel Approach to Efficient Automatic Security Protocol Analysis. J. of Computer Security, 9((1,2)):47–74, 2001.
18. S. Stoller. A Bound on Attacks on Authentication Protocols. Technical Report 526, Indiana University, Computer Science Dept, February 2000.
19. L. Vigneron. Positive Deduction modulo Regular Theories. In Hans Kleine-Büning, editor, Computer Science Logic, LNCS 1092, pages 468–485, Berlin, 1995. Springer- Verlag. URL: http://www.loria.fr/equipes/protheo/SOFTWARES/DATAC/.