SAT-based model-checking of security protocols using planning graph analysis

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

Volumn 2805, Issue , 2003, Pages 875-893

  Armando, Alessandro ^a   Compagna, Luca ^a   Ganty, Pierre ^a  

^a UNIVERSITY OF GENOA   (Italy)

Author keywords

Bounded model checking; SAT encodings; SAT solvers; Security protocols

Indexed keywords

DECISION THEORY; ENCODING (SYMBOLS); FORMAL LOGIC; FORMAL METHODS; NETWORK SECURITY;

BOUNDED MODEL CHECKING; ENCODING TECHNIQUES; ENCODINGS; REDUCTION TECHNIQUES; SAT SOLVERS; SAT-BASED MODEL CHECKING; SATISFIABILITY PROBLEMS; SECURITY PROTOCOLS;

MODEL CHECKING;

EID: 35248876774     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45236-2_47     Document Type: Article

References (26)

1. L. Carlucci Aiello and F. Massacci. Verifying security protocols as planning in logic programming. ACM Trans. on Computational Logic, 2(4):542-580, October 2001.
2. A. Armando, D. Basin, M. Bouallagui, Y. Chevalier, L. Compagna, S. Moedersheim, M. Rusinowitch, M. Turuani, L. Viganò, and L. Vigneron. The AVISS Security Protocols Analysis Tool. In 14th International Conference on Computer-Aided Verification (CAV'02). 2002.
3. A. Armando and L. Compagna. Automatic SAT-Compilation of Protocol Insecurity Problems via Reduction to Planning. In 22nd IFIP WG 6.1 International Conference on Formal Techniques for Networked and Distributed Systems (FORTE), Houston, Texas, November 2002. Also presented at the FCS & Verify Workshops, Copenhagen, Denmark, July 2002.
4. A. Armando and L. Compagna. Abstraction-driven SAT-based Analysis of Security Protocols. In Proceedings of the Sixth International Conference on Theory and Applications of Satisfiability Testing (SAT 2003), S. Margherita Ligure, Italy, May 2003.
5. David Basin, Sebastian Moedersheim, and Luca Vigano. An On-the-Fly Model-Checker for security protocol analysis. Forthcoming, 2003.
6. Armin Biere, Alessandro Cimatti, Edmund Clarke, and Yunshan Zhu. Symbolic model checking without BDDs. In W. R. Cleaveland, editor, Tools and Algorithms for the Construction and Analysis of Systems. Part of European Conferences on Theory and Practice of Software, ETAPS'99, Amsterdam, volume 1579 of LNCS, pages 193-207. Springer-Verlag, 1999.
7. Avrim Blum and Merrick Furst. Fast planning through planning graph analysis. In Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI95), pages 1636-1642, 1995.
8. Iliano Cervesato, N. A. Durgin, Patrick Lincoln, John C. Mitchell, and Andre Scedrov. A meta-notation for protocol analysis. In CSFW, pages 55-69, 1999.
9. Y. Chevalier and L. Vigneron. A Tool for Lazy Verification of Security Protocols. In Proceedings of the Automated Software Engineering Conference (ASE'01). IEEE Computer Society Press, 2001. Long version available as Technical Report A01-R-140, LORIA, Nancy (France).
10. John Clark and Jeremy 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.
11. Minh Binh Do, Biplav Srivastava, and Subbarao Kambhampati. Investigating the effect of relevance and reachability constraints on SAT encodings of planning. In Artificial Intelligence Planning Systems, pages 308-314, 2000.
12. Danny Dolev and Andrew Yao. On the security of public-key protocols. IEEE Transactions on Information Theory, 2(29), 1983.
13. B. Donovan, P. Norris, and G. Lowe. Analyzing a library of security protocols using Casper and FDR. In Proceedings of the Workshop on Formal Methods and Security Protocols. 1999.
14. Michael D. Ernst, Todd D. Millstein, and Daniel S. Weld. Automatic SAT-compilation of planning problems. In Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCA1-97), pages 1169-1177. Morgan Kaufmann Publishers, San Francisco, 1997.
15. E. Giunchiglia, M. Maratea, A. Tacchella, and D. Zambonin. Evaluating search heuristics and optimization techniques in propositional satisfiability. In Proceedings of IJCAR'2001, LNAI 2083, pages 347-363. Springer-Verlag, Heidelberg, 2001.
16. Heather, Lowe, and Schneider. How to prevent type flaw attacks on security protocols. In PCSFW: Proceedings of The 13th Computer Security Foundations Workshop. IEEE Computer Society Press, 2000.
17. Florent Jacquemard, Michael Rusinowitch, and Laurent Vigneron. Compiling and Verifying Security Protocols. In M. Parigot and A. Voronkov, editors, Proceedings of LPAR 2000, LNCS 1955, pages 131-160. Springer-Verlag, Heidelberg, 2000.
18. Henry Kautz, David McAllester, and Bart Selman. Encoding plans in propositional logic. In KR '96: Principles of Knowledge Representation and Reasoning, pages 374-384. Morgan Kaufmann, San Francisco, California, 1996.
19. Henry A. Kautz and Bart Selman. Unifying SAT-based and graph-based planning. In Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence (IJCAI'99), pages 318-325, Stockholm, Sweden, July 31-August 6 1999. Morgan Kaufmann.
20. G. Lowe. Breaking and fixing the Needham-Shroeder public-key protocol using FDR. In Proceedings of TACAS'96, pages 147-166. Springer-Verlag, 1996.
21. J.C. Mitchell, M. Mitchell, and U. Stern. Automated analysis of cryptographic protocols using murphi. In Proceedings of IEEE Symposium on Security and Privacy, pages 141-153. 1997.
22. Matthew W. Moskewicz, Conor F. Madigan, Ying Zhao, Lintao Zhang, and Sharad Malik. Chaff: Engineering an Efficient SAT Solver. In Proceedings of the 38th Design Automation Conference (DAC'01). 2001.
23. R. M. (Roger Michael) Needham and Michael D. Schroeder. Using encryption for authentication in large networks of computers. Technical Report CSL-78-4, Xerox Palo Alto Research Center, Palo Alto, CA, USA, 1978. Reprinted June 1982.
24. D. Song. Athena: A new efficient automatic checker for security protocol analysis. In Proceedings of the 12th IEEE Computer Security Foundations Workshop (CSFW '99), pages 192-202. IEEE Computer Society Press, 1999.
25. Daniel S. Weld. Recent advances in AI planning. AI Magazine, 20(2):93-123, 1999.
26. H. Zhang. SATO: An efficient prepositional prover. In William McCune, editor, Proceedings of CADE 14, LNAI 1249, pages 272-275. Springer-Verlag, Heidelberg, 1997.