Semantics and logic for security protocols

Journal of Computer Security

Volumn 17, Issue 6, 2009, Pages 909-944

  Jacobs, Bart ^a,c   Hasuo, Ichiro ^a,b  

^a RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

^b KYOTO UNIVERSITY   (Japan)

^c EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Authentication; Logic; Secrecy; Security protocols; Theorem proving

Indexed keywords

AUTHENTICATION LOGIC; BAN-LIKE LOGIC; KEY EXCHANGE; LOGIC; NEEDHAM-SCHROEDER; SECURITY PROTOCOLS; STRAND SPACE; THEOREM PROVERS;

AUTHENTICATION; NETWORK PROTOCOLS; PROBLEM SOLVING; SEMANTICS; TEMPORAL LOGIC; THEOREM PROVING;

NETWORK SECURITY;

EID: 71749089654     PISSN: 0926227X     EISSN: None     Source Type: Journal    
DOI: 10.3233/JCS-2009-0348     Document Type: Article

References (31)

1. M. Abadi and A. Gordon, A calculus for cryptographic protocols, J. ACM 148(1) (1999), 1-70.
2. P. Blackburn, M. de Rijke and Y. Venema, Modal Logic, Tracts in Theoretical Computer Science, Vol.53, Cambridge University Press, Cambridge, 2001.
3. P. Broadfoot and A. Roscoe, Proving security protocols with model checkers by data independence techniques, J. Comput. Secur. 7 (1999), 147-190.
4. M. Burrows,M. Abadi and R. Needham, A logic of authentication, Proc. Roy. Soc. Ser. A 426 (1989), 233-271.
5. J. Clark and J. Jacob, A survey of authentication protocol literature: Version 1.0, Univ. of York, www-users.cs.york.ac.uk/?jac/papers/drareviewps.ps, 1997.
6. A. Datta, A. Derek, J.C. Mitchell and D. Pavlovic, A derivation system and compositional logic for security protocols, J. Comput. Secur. 13(3) (2005), 423-482.
7. A. Datta, A. Derek, J.C. Mitchell and A. Roy, Protocol composition logic (PCL), Elect. Notes Theor. Comput. Sci. 172 (2007), 311-358.
8. B. Davey and H. Priestley, Introduction to Lattices and Order, Mathematics Textbooks, Cambridge University Press, Cambridge, 1990.
9. S.F. Doghmi, J.D. Guttman and F.J. Thayer Fàbrega, Searching for shapes in cryptographic protocols, in: Tools and Algorithms for the Construction and Analysis of Systems (TACAS'07), LNCS, Vol.4424, Springer, Berlin, 2007, pp. 523-538 (extended version is at Cryptology ePrint Archive: eprint.iacr.org/ 2006/435).
10. D. Dolev and A. Yao, On the security of public key protocols, IEEE Trans. Inform. Theor. 29(2) (1983), 198-208.
11. N.A. Durgin, J.C. Mitchell and D. Pavlovic, A compositional logic for proving security properties of protocols, J. Comput. Secur. 11(4) (2003), 677-722.
12. R. Fagin, J. Halpern, Y. Moses and M. Vardi, Reasoning About Knowledge, MIT Press, Cambridge, MA, 1995.
13. F. Garcia, I. Hasuo, W. Pieters and P. van Rossum, Provable anonymity, in: 3rd ACM Workshop on Formal Methods in Security Engineering (FMSE05), R. Küsters and J. Mitchell, eds, Alexandria, VA, USA, November 2005, ACM Press, 2005, pp. 63-72.
14. R. Goldblatt, Logics of Time and Computation, 2nd edn, CSLI Lecture Notes, Vol.7, Stanford, 1992.
15. J. Guttman, Key compromise, strand spaces and the authentication tests, in: Mathematical Foundations of Programming Semantics 17, Electronic Notes in Theoretical Computer Science, Vol.47, Elsevier, Amsterdam, 2001, pp. 1-21.
16. J. Guttman, J. Herzog and F. Thayer Fàbrega, Honest ideals on strand spaces, in: Computer Security Foundations Workshop, 1998; available at: http://doi.ieeecomputersociety.org/ 10.1109/CSFW.1998.683156.
17. J. Guttman and F. Thayer Fàbrega, Authentication tests and the structure of bundles, Theor. Comp. Sci. 283(2) (2002), 333-380.
18. J.Y. Halpern and R. Pucella, On the relationship between strand spaces and multi-agent systems, ACM Trans. Inf. Syst. Secur. 6(1) (2003), 43-70.
19. J. Heather, G. Lowe and S. Schneider, How to prevent type flaw attacks on security protocols, J. Comput. Secur. 11(2) (2003), 217-244.
20. B. Jacobs and I. Hasuo, PVS sources for semantics and logic of security protocols, www.cs.ru.nl/B.Jacobs/PVS/protocols-3.0.zip, 2006.
21. G. Lowe, Breaking and fixing the Needham-Schroeder public-key protocol using CSP and FDR, in: Tools and Algorithms for the Construction and Analysis of Systems, T. Margaria and B. Steffen, eds, LNCS, Vol.1055, Springer, Berlin, 1996, pp. 147-166. (Pubitemid 126050413)
22. C. Meadows, The NRL protocol analyzer: An overview, J. Log. Progr. 26(2) (1996), 113-131.
23. C. Meadows, Identifying potential type confusion in authenticated messages, Workshop on Foundations of Computer Security, Technical Report DIKU-02-12, Department of Computer Science, University Copenhagen, 2002.
24. R. Needham and M. Schroeder, Using encryption for authentication in large networks of computers, Commun. ACM 21(12) (1978), 993-999.
25. D. Otway and O. Rees, Efficient and timely mutual authentication, Operating Syst. Rev. 21(1) (1987), 8-10.
26. S. Owre, J. Rushby, N. Shankar and F. von Henke, Formal verification for fault-tolerant architectures: Prolegomena to the design of PVS, IEEE Trans. Softw. Eng. 21(2) (1995), 107-125.
27. L. Paulson, The inductive approach to verifying cryptographic protocols, J. Comput. Secur. 6 (1998), 85-128.
28. P. Ryan, S. Schneider, M. Goldschmith, G. Lowe and A. Roscoe, The Modelling and Analysis of Security Protocols: The CSP Approach, Addison-Wesley, 2001.
29. P. Syverson, Towards a strand semantics for authentication logics, in: Mathematical Foundations of Progamming Semantics, S. Brookes, A. Jung, M. Mislove and A. Scedrov, eds, Electronic Notes in Theoretical Computer Science, Vol.20, Elsevier, Amsterdam, 1999.
30. P. Syverson and I. Cervesato, The logic of authentication protocols, in: Foundations of Security Analysis and Design, C. Batini, F. Giunchiglia, P. Giorgini and M. Mecella, eds, LNCS, Vol.2171, Springer, Berlin, 2001, pp. 63-136.
31. F. Thayer Fàbrega, J. Herzog and J. Guttman, Strand spaces: Proving security protocols correct, J. Comput. Secur. 7 (1999), 191-230.