Types and effects for asymmetric cryptographic protocols

Journal of Computer Security

Volumn 12, Issue 3-4 SPEC. ISS., 2004, Pages 435-483

  Gordon, Andrew D ^a   Jeffrey, Alan ^b  

^a MICROSOFT RESEARCH   (United States)

^b DEPAUL UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA REDUCTION; FORMAL LOGIC; NETWORK PROTOCOLS; PUBLIC KEY CRYPTOGRAPHY; THEOREM PROVING;

ASSYMETRIC KEY CRYPTOGRAPHY; DECRYPTION;

SECURITY OF DATA;

EID: 3042660681     PISSN: 0926227X     EISSN: None     Source Type: Journal    
DOI: 10.3233/jcs-2004-123-406     Document Type: Conference Paper

References (37)

1. M. Abadi and B. Blanchet, Analyzing security protocols with secrecy types and logic programs, in: 29th ACM Symposium on Principles of Programming Languages, 2002, pp. 33-44.
2. M. Abadi and B. Blanchet, Secrecy types for asymmetric communication, Theoretical Computer Science 298(3) (2003), 387-415.
3. M. Abadi, Secrecy by typing in security protocols, Journal of the ACM 46(5) (1999), 749-786.
4. D. Aspinall and A. Compagnoni, Subtyping dependent types, Theoretical Computer Science 266(1-2) (2001), 273-309.
5. M. Abadi and A.D. Gordon, A calculus for cryptographic protocols: The spi calculus, Information and Computation 148 (1999), 1-70.
6. M. Burrows, M. Abadi and R.M. Needham, A logic of authentication, Proceedings of the Royal Society of London A 426 (1989), 233-271.
7. B. Blanchet, From secrecy to authenticity in security protocols, in: 9th International Static Analysis Symposium (SAS'02), Volume 2477 of Lecture Notes in Computer Science, Springer, 2002, pp. 242-259.
8. D. Bolignano, An approach to the formal verification of cryptographic protocols, in: Third ACM Conference on Computer and Communications Security, 1996, pp. 106-118.
9. I. Cervesato, Typed MSR: Syntax and examples, in: First International Workshop on Mathematical Methods, Models and Architectures for Computer Network Security, Volume 2052 of Lecture Notes in Computer Science, Springer, 2001, pp. 159-177.
10. N. Carriero and D. Gelernter, Linda in context, Communications of the ACM 32(4) (1989), 444-458.
11. J. Clark and J. Jacob, A survey of authentication protocol literature, Unpublished report, University of York, 1997.
12. N. Durgin, J.C. Mitchell and D. Pavlovic, A compositional logic for protocol correctness, in: 14th IEEE Computer Security Foundations Workshop, IEEE Computer Society Press, 2001, pp. 241-255.
13. D. Dolev and A.C. Yao, On the security of public key protocols, IEEE Transactions on Information Theory IT-29(2) (1983), 198-208.
14. A.D. Gordon and A. Jeffrey, Authenticity by typing for security protocols, in: 14th IEEE Computer Security Foundations Workshop, IEEE Computer Society Press, 2001, pp. 145-159. Extended version to appear in J. Computer Security.
15. A.D. Gordon and A. Jeffrey, Authenticity by typing for security protocols, in: 14th IEEE Computer Security Foundations Workshop, IEEE Computer Society Press, 2001, pp. 145-159. Extended version to appear in J. Computer Security.
16. A.D. Gordon and A. Jeffrey, Types and effects for asymmetric cryptographic protocols, Technical Report MSR-TR-2002-31, Microsoft Research, August, 2002.
17. A.D. Gordon and A. Jeffrey, Types and effects for asymmetric cryptographic protocols, in: 15th IEEE Computer Security Foundations Workshop, IEEE Computer Society Press, 2002, pp. 77-91.
18. A.D. Gordon and A. Jeffrey, Typing correspondence assertions for communication protocols, Theoretical Computer Science 300 (2003), 379-409.
19. A.D. Gordon and R. Pucella, Validating a web service security abstraction by typing, in: 2002 ACM Workshop on XML Security, ACM Press, 2002, pp. 62-73. An extended version appears as Technical Report MSR-TR-2002-108, Microsoft Research, December, 2002.
20. A.D. Gordon and R. Pucella, Validating a web service security abstraction by typing, in: 2002 ACM Workshop on XML Security, ACM Press, 2002, pp. 62-73. An extended version appears as Technical Report MSR-TR-2002-108, Microsoft Research, December, 2002.
21. J.D. Guttman and F.J. Thayer, Authentication tests and the structure of bundles, Theoretical Computer Science 283(2) (2002), 333-380.
22. N. Heintze and J.G. Riecke, The SLam calculus: Programming with secrecy and integrity, in: 25th ACM Symposium on Principles of Programming Languages, 1998, pp. 365-377.
23. J. Heather and S. Schneider, Towards automatic verification of authentication protocols on an unbounded network, in: 13th IEEE Computer Security Foundations Workshop, IEEE Computer Society Press, 2000, pp. 132-143.
24. 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, Volume 1055 of Lecture Notes in Computer Science, Springer, 1996, pp. 147-166.
25. G. Lowe, A hierarchy of authentication specifications, in: 10th IEEE Computer Security Foundations Workshop, IEEE Computer Society Press, 1997, pp. 31-43.
26. W. Marrero, E.M. Clarke and S. Jha, Model checking for security protocols, in: DIMACS Workshop on Design and Formal Verification of Security Protocols, 1997. Preliminary version appears as Technical Report TR-CMU-CS-97-139, Carnegie Mellon University, May, 1997.
27. W. Marrero, E.M. Clarke and S. Jha, Model checking for security protocols, in: DIMACS Workshop on Design and Formal Verification of Security Protocols, 1997. Preliminary version appears as Technical Report TR-CMU-CS-97-139, Carnegie Mellon University, May, 1997.
28. R. Milner, Communicating and Mobile Systems: The π-Calculus, Cambridge University Press, 1999.
29. R.M. Needham and M.D. Schroeder, Using encryption for authentication in large networks of computers, Communications of the ACM 21(12) (1978), 993-999.
30. P. Ørbæk and J. Palsberg, Trust in the λ-calculus, Journal of Functional Programming 3(2) (1997), 75-85.
31. L.C. Paulson, The inductive approach to verifying cryptographic protocols, Journal of Computer Security 6 (1998), 85-128.
32. D. Song, S. Berezin and A. Perrig, Athena, a novel approach to efficient automatic security protocol analysis, Journal of Computer Security 9(1,2) (2001), 47-74.
33. S.A. Schneider, Verifying authentication protocols in CSP, IEEE Transactions on Software Engineering 24(9) (1998), 741-758.
34. U. Shankar, K. Talwar, J.S. Foster and D. Wagner, Detecting format string vulnerabilities with type qualifiers, in: 10th USENIX Security Symposium, 2001.
35. F.J. Thayer Fábrega, J.C. Herzog and J.D. Guttman, Strand spaces: Proving security protocols correct, Journal of Computer Security 7 (1999), 191-230.
36. L. Wall, T. Christiansen and R.L. Schwartz, Programming Perl, 2nd edn, O'Reilly Associates, 1996.
37. T.Y.C. Woo and S.S. Lam, A semantic model for authentication protocols, in: IEEE Computer Society Symposium on Research in Security and Privacy, 1993, pp. 178-194.