Proof theory, transformations, and logic programming for debugging security protocols

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

Volumn 2372 LNCS, Issue , 2002, Pages 76-90

  Delzanno, Giorgio ^a   Etalle, Sandro ^b  

^a UNIVERSITY OF GENOA   (Italy)

^b UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; COMPUTER CIRCUITS; DIFFERENTIATION (CALCULUS); LOGIC PROGRAMMING; SEMANTICS; FORMAL LOGIC; PROLOG (PROGRAMMING LANGUAGE); RECONFIGURABLE HARDWARE;

NEEDHAM-SCHROEDER; OPERATIONAL SEMANTICS; PRELIMINARY ANALYSIS; PROOF STRATEGY; SAFETY PROPERTY; SECURITY PROTOCOLS; SEQUENT CALCULUS; SPECIAL CLASS;

NETWORK SECURITY;

EID: 84879482667     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45607-4_5     Document Type: Conference Paper

References (30)

1. M. Abadi and B. Blanchet. Analyzing Security Protocols with Secrecy Types and Logic Programs. In Proc. POPL 2002, pages 33-44, 2002
2. L. C. Aiello and F. Massacci. Verifying security protocols as planning in logic programming. Trans. on Computational Logic, 2001
3. D. Basin. Lazy infinite-state analysis of security protocols. Secure Networking-CQRE [Secure] '99, LNCS 1740, pages 30-42, 1999
4. G. Bella and L. C. Paulson. Kerberos version IV: Inductive analysis of the secrecy goals. In Proc.5th Symp. on Research in Computer Security, LNCS 1485, pages 361-375, 1998
5. B. Blanchet. An efficient cryptographic protocol verifier based on prolog rules. In Proc. CSFW'01, 2001
6. M. Burrows, M. Abadi, and R. Needham. A logic of authentication. ACM Trans. on Computer Systems, 8(1):18-36, 1990
7. I. Cervesato, N. Durgin, P. Lincoln, J. Mitchell, and A. Scedrov. A meta-notation for protocol analysis. In Proc. CSFW '99, pages 55-69, 1999
8. I. Cervesato, N. Durgin, J. Mitchell. Lincoln, and A. Scedrov. Relating strands and multiset rewriting for security protocol analysis. In Proc. CSFW '00, pages 35-51, 2000
9. Y. Chevalier, F. Jacquemard, M. Rusinowitch, M. Turuani, and L. Vigneron. CASRUL web site. http://www.loria.fr/equipes/protheo/SOFTWARES/CASRUL/
10. Y.Chevalier and L.Vigneron. A tool for lazy verification of security protocols. In Proc. Int'l Conf. Automated Software Engineering, 2001
11. Y.Chevalier and L.Vigneron. Towards efficient automated verification of security protocols. In Proc. VERIF '01, 2001
12. G. Delzanno. Specifying and debugging security protocols via hereditary harrop formulas and lambda prolog. In Proc. FLOPS '01, pages 123-137, 2001
13. D. Dolev and A. C. Yao. On the security of public key protocols. IEEE Trans. on Information Theory, 29(2):198-208, 1983
14. N. Durgin, P. Lincoln, J. Mitchell, and A. Scedrov. Undecidability of bounded security protocols. In Proc. FMSP'99 (FLOC '99), 1999
15. A. Huima. Efficient infinite-state analysis of security protocols. In Proc. FMSP '99 (FLOC '99), 1999
16. F. Jacquemard, M. Rusinowitch, and L. Vigneron. Compiling and verifying security protocols. In Proc. LPAR 2000, LNCS 1995, pages 131-160, 2000
17. G. Lowe. Breaking and fixing the Needham-Schroeder public-key protocol using FDR. Software Concepts and Tools, (17):93-102, 1996
18. G. Lowe. Casper: A compiler for the analysis of security protocols. In Proc.CSFW '97, pages 18-30, 1997
19. G. Lowe. Towards a completeness result for model checking of security protocols. J. of Computer Security, 7(2-3):89-146, 1998
20. C. Meadows. Formal verification of cryptographic protocols: A survey. In Proc. ASIACRYPT '94, pages 133-150, 1995
21. C. Meadows. The NRL protocol analyzer: An overview. J. of Logic Programming, 26(2):113-131, 1996
22. J. Millen and V. Shmatikov. Constraint solving for bounded-process cryptographic protocol analysis. In Proc. 2001 ACM Conf. on Computer and Communication Security, pages 166-175, 2001
23. J. K. Millen, S. C. Clark, and S. B. Freedman. The Interrogator: Protocol security analysis. IEEE Trans. on Software Engineering, 13(2):274-288, 1987
24. J. C. Mitchell, M. Mitchell, and U. Stern. Automated analysis of cryptographic protocols using mur?. In Proc. Conf. on Security and Privacy, pages 141-153, 1997
25. R. M. Needham and M. D. Schroeder. Using encryption for authentication in large networks of computers. Comm. of the ACM, 21(12):993-999, 1978
26. L. C. Paulson. Mechanized proofs of security protocols: Needham-Schroeder with public keys. T.R. 413, Univ. of Cambridge, Computer Laboratory, January 1997
27. L. C. Paulson. The inductive approach to verifying cryptographic protocols. J. of Computer Security, 6:85-128, 1998
28. A. W. Roscoe. Modelling and verifying key-exchange protocols using csp and fdr. In IEEE Symp. on Foundations of Secure Systems, 1995
29. A. W. Roscoe. The Theory and Practice of Concurrency. Prentice-Hall, 1999
30. M. Rusinowitch and M. Turuani. Protocol insecurity with finite number of sessions is np-complete. In Proc. CSFW '01, 2001.