Abstraction-driven SAT-based analysis of security protocols

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

Volumn 2919, Issue , 2004, Pages 257-271

  Armando, Alessandro ^a   Compagna, Luca ^a  

^a UNIVERSITY OF GENOA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; FORMAL LOGIC; NETWORK SECURITY;

AUTOMATIC MODELING; AUTOMATIC TRANSLATION; MODEL CHECKER; PROPOSITIONAL LOGIC; PROTOCOL INSECURITY; SAT SOLVERS; SAT-BASED ANALYSIS; SECURITY PROTOCOLS;

MODEL CHECKING;

EID: 35048841165     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24605-3_20     Document Type: Article

References (31)

1. L. Carlucci Aiello and F. Massacci. Verifying security protocols as planning in logic programming. ACM Trans, on Computational Logic, 2(4):542-580, 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 Proc. CAV'02. 2002.
3. A. Armando and L. Compagna. Automatic SAT-Compilation of Protocol Insecurity Problems via Reduction to Planning. In Intl. Conf. on Formal Techniques for Networked and Distributed Systems (FORTE), Houston, Texas, November 2002.
4. A. Armando, Compagna. L., and P. Ganty. Sat-based model-checking of security protocols. In Proc. of Formal Methods Europe 2003 (FME03), Pisa, Sept. 2003.
5. David Basin and Grit Denker. Maude versus haskell: an experimental comparison in security protocol analysis. In Kokichi Futatsugi, editor, Electronic Notes in Theoretical Computer Science, volume 36. Elsevier Science Publishers, 2001.
6. David Basin, Sebastian Moedersheim, and Luca Viganò. An On-the-Fly Model-Checker for security protocol analysis. Forthcoming, 2003.
7. D. Bolignano. Towards the formal verification of electronic commerce protocols. In Proc.of the IEEE Computer Security Foundations Workshop, pages 133-146. 1997.
8. Cervesato, Durgin, Mitchell, Lincoln, and Scedrov. Relating strands and multiset rewriting for security protocol analysis. In PCSFW: Proceedings of The 13th Computer Security Foundations Workshop. IEEE Computer Society Press, 2000.
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.
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. E. Clarke, A. Gupta, J. Kukula, and O. Strichman. SAT based abstraction-refinement using ILP and machine learning techniques. In Proc. of Conference on Computer-Aided Verification (CAV'02), LNCS, 2002.
12. Ernie Cohen. TAPS: A first-order verifier for cryptographic protocols. In Proc. of The 13th Computer Security Foundations Workshop, 2000.
13. James M. Crawford and L. D. Anton. Experimental results on the crossover point in satisfiability problems. In Richard Fikes and Wendy Lehnert, editors, Proceedings of the 11th AAAI Conference, pages 21-27, California, 1993. AAAI Press.
14. Grit Denker, Jonathan Millen, and Harald Rueß. The CAPSL Integrated Protocol Environment. Technical Report SRI-CSL-2000-02, SRI International, Menlo Park, CA, October 2000. Available at http://www.csl.sri.com/~millen/capsl/ .
15. Danny Dolev and Andrew Yao. On the security of public-key protocols. IEEE Transactions on Information Theory, 2(29), 1983.
16. 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.
17. 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 (IJCAI-97), pages 1169-1177. Morgan Kaufmann Publishers, San Francisco, 1997.
18. E. Giunchiglia, M. Maratea, A. Tacchella, and D. Zambonin. Evaluating search heuristics and optimization techniques in propositional satisfiability. In Proceedings of IJCAR'2001, pages 347-363. Springer-Verlag, 2001.
19. 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.
20. 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.
21. 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.
22. G. Lowe. Breaking and fixing the Needham-Shroeder public-key protocol using FDR. In Proceedings of TACAS'96, pages 147-166. Springer-Verlag, 1996.
23. Gawin Lowe. Casper: a compiler for the analysis of security protocols. Journal of Computer Security, 6(1):53-84, 1998.
24. W. Marrero, E. Clarke, and S. Jha. Model checking for security protocols, 1997.
25. Catherine Meadows. The NRL protocol analyzer: An overview. Journal of Logic Programming, 26(2):113-131, 1996.
26. J.C. Mitchell, M. Mitchell, and U. Stern. Automated analysis of cryptographic protocols using murphi. In Proc.of IEEE Symposium on Security and Privacy, pages 141-153. 1997.
27. 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.
28. 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.
29. L.C. Paulson. The inductive approach to verifying cryptographic protocols. Journal of Computer Security, 6(1):85-128, 1998.
30. 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.
31. H. Zhang. SATO: An efficient propositional prover. In William McCune, editor, Proceedings of CADE 14, LNAI 1249, pages 272-275. Springer-Verlag, 1997.