A compositional logic for proving security properties of protocols

Journal of Computer Security

Volumn 11, Issue 4, 2003, Pages 677-721

  Durgin, Nancy ^a   Mitchell, John ^b   Pavlovic, Dusko ^c  

^a SANDIA NATIONAL LABORATORIES   (United States)

^b Stanford University   (United States)

^c KESTREL INSTITUTE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC; PUBLIC KEY CRYPTOGRAPHY; RANDOM NUMBER GENERATION; SEMANTICS;

SECURITY PROPERTIES;

SECURITY OF DATA;

EID: 0141751776     PISSN: 0926227X     EISSN: None     Source Type: Journal    
DOI: 10.3233/JCS-2003-11407     Document Type: Conference Paper

References (29)

1. M. Abadi and A. Gordon. A calculus for cryptographic protocols: the spi calculus, Information and Computation 148(1) (1999), 1-70. Expanded version available as SRC Research Report 149 (January 1998).
2. G. Berry and G. Boudol. The chemical abstract machine, Theoretical Computer Science 96 (1992), 217-248.
3. M. Burrows, M. Abadi and R. Needham, A logic of authentication, in: Proceedings of the Royal Society, Series A 426(1871) (1989), 233-271. Also appeared as SRC Research Report 39 and, in a shortened form, in ACM Transactions on Computer Systems 8(1) (1990), 18-36.
4. M. Burrows, M. Abadi and R. Needham, A logic of authentication, in: Proceedings of the Royal Society, Series A 426(1871) (1989), 233-271. Also appeared as SRC Research Report 39 and, in a shortened form, in ACM Transactions on Computer Systems 8(1) (1990), 18-36.
5. I. Cervesato, N. Durgin, P. Lincoln, J. Mitchell and A. Scedrov, A meta-notation for protocol analysis, in: 12-th IEEE Computer Security Foundations Workshop, P. Syverson. ed., IEEE Computer Society Press, 1999.
6. F. Crazzolara and G. Winskel, Events in security protocols, in: ACM Conference on Computer and Communications Security, 2001, pp. 96-105.
7. F. Crazzolara and G. Winskel, Composing strand spaces, in: FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science, 22nd Conference Kanpur, India, M. Agrawal and A. Seth, eds, Proceedings, Volume 2556 of Lecture Notes in Computer Science, Springer, 2002.
8. D. Dolev and A. Yao, On the security of public-key protocols, IEEE Transactions on Information Theory 2(29) (1983).
9. F.J.T. Fábrega, J.C. Herzog and J.D. Guttman, Strand spaces: Why is a security protocol correct? in: Proceedings of the 1998 IEEE Symposium on Security and Privacy, Oakland. CA, IEEE Computer Society Press, 1998, pp. 160-171.
10. R.W. Floyd, Assigning meaning to programs, in: Mathematical aspects of computer science: Proc. American Mathematics Soc. Symposia, J.T. Schwanz, ed., Volume 19, Providence RI, American Mathematical Society, 1967, pp. 19-31.
11. L. Gong, R. Needham and R. Yahalom, Reasoning about belief in cryptographic protocols, in: Proceedings 1990 IEEE Symposium on Research in Security and Privacy, D. Cooper and T. Lunt, eds, IEEE Computer Society. 1990, pp. 234-248.
12. C.A.R. Hoare, An axiomatic basis for computer programming, Communications of the ACM 12(10) (1969), 576-580.
13. K.G. Larsen and R. Milner, A compositional protocol verification using relativized bisimulation, Information and Computation 99 (1992).
14. G. Lowe, An attack on the Needham-Schroeder public-key protocol, Info. Proc. Letters 56 (1995), 131-133.
15. G. Lowe, Breaking and fixing the Needham-Schroeder public-key protocol using CSP and FDR, in: 2nd International Workshop on Tools and Algorithms for the Construction and Analysis of Systems, Springer-Verlag, 1996.
16. C. Meadows, The NRL protocol analyzer: an overview, J. Logic Programming 26(2) (1996), 113-131.
17. R. Milner, Action structures, LFCS report ECS-LFCS-92-249, Department of Computer Science, University of Edinburgh, JCMB, The Kings Buildings, Mayfield Road, Edinburgh, December 1992.
18. R. Milner, Action calculi and the π-calculus, in: NATO Summer School on Logic and Computation, Marktoberdorf, 1993.
19. R. Milner, Action calculi, or syntactic action structures, in: Mathematical Foundations of Computer Science 1993, 18th International Symposium, MFCS '93, Springer, 1993, pp. 105-121.
20. R. Milner, Communicating and Mobile Systems: The π-Calculus. Cambridge University Press, Cambridge, UK, 1999.
21. R. Milner, J. Parrow and D. Walker, A calculus of mobile processes, part i, Information and Computation 100(1) (1992), 1-40.
22. J. Mitchell, M. Mitchell and U. Stern, Automated analysis of cryptographic protocols using Murφ, in: Proc. IEEE Symp. Security and Privacy, 1997, pp. 141-151.
23. R. Needham and M. Schroeder, Using encryption for authentication in large networks of computers, Communications of the ACM 21(12) (1978), 993-999.
24. L. Paulson, Proving properties of security protocols by induction, in: 10th IEEE Computer Security Foundations Workshop, 1997, pp. 70-83.
25. D. Pavlovic, Categorical logic of names and abstraction in action calculi, Math. Structures in Comp. Sci. 7(6) (1997), 619-637.
26. A.W. Roscoe, Modelling and verifying key-exchange protocols using CSP and FDR, in: 8th IEEE Computer Security Foundations Workshop. IEEE Computer Soc. Press, 1995, pp. 98-107.
27. P. Syverson, Adding time to a logic of authentication, in: ACM Conference on Computer and Communications Security, 1993, pp. 97-101.
28. P. Syverson and P. van Oorschot, On unifying some cryptographic protocol logics, in: Proc. 1994 IEEE Computer Security Foundations Workshop VII. 1994, pp. 14-29.
29. J. Thayer, J. Herzog and J. Guttman, Strand spaces: Proving security protocols correct, 1999, Journal of Computer Security 15 (1999).