Typing one-to-one and one-to-many correspondences in security protocols

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

Volumn 2609, Issue , 2003, Pages 263-282

  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

CALCULATIONS;

CORRECTNESS PROPERTIES; CRYPTOGRAPHIC PROTOCOLS; SECURITY PROTOCOLS; SPI CALCULUS; TYPE AND EFFECT SYSTEMS;

NETWORK SECURITY;

EID: 35248815623     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36532-x_17     Document Type: Article

References (32)

1. M. Abadi and B. Blanchet. Secrecy types for asymmetric communication. In Foundations of Software Science and Computation Structures, volume 2030 of Lecture Notes in Computer Science, pages 25-41. Springer, 2001.
2. M. Abadi. Secrecy by typing in security protocols. Journal of the ACM, 46(5):749-786, September 1999.
3. M. Abadi, C. Fournet, and G. Gonthier. Secure communications implementation of channel abstractions. In 13th IEEE Symposium on Logic in Computer Science (LICS'98), pages 105-116, 1998.
4. M. Abadi, C. Fournet, and G. Gonthier. Authentication primitives and their compilation. In 27th ACM Symposium on Principles of Programming Languages (POPL'00), pages 302-315, 2000.
5. M. Abadi and A.D. Gordon. A calculus for cryptographic protocols: The spi calculus. Information and Computation, 148:1-70, 1999.
6. R. Anderson and R. Needham. Programming Satan's computer. In J. van Leeuwen, editor, Computer Science Today: Recent Trends and Developments, volume 1000 of Lecture Notes in Computer Science, pages 426-440. Springer, 1995.
7. M. Burrows, M. Abadi, and R.M. Needham. A logic of authentication. Proceedings of the Royal Society of London A, 426:233-271, 1989.
8. F. Butler, I. Cervesato, A.D. Jaggard, and A. Scedrov. A formal analysis of some properties of Kerberos 5 using MSR. In 15th IEEE Computer Security Foundations Workshop, pages 175-190. IEEE Computer Society Press, 2002.
9. 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, pages 242-259. Springer, 2002.
10. 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, pages 159-177. Springer, 2001.
11. D. Duggan. Cryptographic types. In 15th IEEE Computer Security Foundations Workshop, pages 238-252. IEEE Computer Society Press, 2002.
12. D. Dolev and A.C. Yao. On the security of public key protocols. IEEE Transactions on Information Theory, IT-29(2):198-208, 1983.
13. J. Engelfriet. A multiset semantics for the pi-calculus with replication. Theoretical Computer Science, 153:65-94, 1996.
14. R. Focardi and R. Gorrieri. A classification of security properties for process algebra. Journal of Computer Security, 3(1):5-33, 1994.
15. R. Focardi, R. Gorrieri, and F. Martinelli. Message authentication through non-interference. In International Conference on Algebraic Methodology And Software Technology (AMAST2000), volume 1816 of Lecture Notes in Computer Science, pages 258-272. Springer, 2000.
16. A.D. Gordon and A. Jeffrey. Authenticity by typing for security protocols. In 14th IEEE Computer Security Foundations Workshop, pages 145-159. IEEE Computer Society Press, 2001.
17. A.D. Gordon and A. Jeffrey. Typing correspondence assertions for communication protocols. In Mathematical Foundations of Programming Semantics 17, volume 45 of Electronic Notes in Theoretical Computer Science. Elsevier, 2001.
18. A.D. Gordon and A. Jeffrey. Types and effects for asymmetric cryptographic protocols. In 15th IEEE Computer Security Foundations Workshop, pages 77-91. IEEE Computer Society Press, 2002.
19. D.K. Gifford and J.M. Lucassen. Integrating functional and imperative programming. In ACM Conference on Lisp and Functional Programming, pages 28-38, 1986.
20. D. Gollmann. Authentication by correspondence. IEEE Journal on Selected Areas in Communication, 2002. To appear.
21. A.D. Gordon and R. Pucella. Validating a web service security abstraction by typing. In ACM Workshop on XML Security, 2002. To appear.
22. J.D. Guttman and F. J. Thayer. Authentication tests and the structure of bundles. Theoretical Computer Science, 283(2):333-380, 2002.
23. B.A. LaMacchia, S. Lange, M. Lyons, R. Martin, and K.T. Price. .NET Framework Security. Addison Wesley Professional, 2002.
24. G. Lowe. A hierarchy of authentication specifications. In 10th IEEE Computer Security Foundations Workshop, pages 31-43. IEEE Computer Society Press, 1997.
25. T. Lindholm and F. Yellin. The Java™ Virtual Machine Specification. Addison-Wesley, 1997.
26. C. Meadows. The NRL Protocol Analyzer: An overview. Journal of Logic Programming, 26(2):113-131, 1996.
27. L.C. Paulson. The inductive approach to verifying cryptographic protocols. Journal of Computer Security, 6:85-128, 1998.
28. B. Pierce and E. Sumii. Relating cryptography and polymorphism. Available from the authors, 2000.
29. A.W. Roscoe. Intensional specifications of security protocols. In 8th IEEE Computer Security Foundations Workshop, pages 28-38. IEEE Computer Society Press, 1996.
30. S.A. Schneider. Verifying authentication protocols in CSP. IEEE Transactions on Software Engineering, 24(9):741-758, 1998.
31. A. Sabelfeld and A.C. Myers. Language-based information-flow security. IEEE Journal on Selected Areas in Communication, 2002. To appear.
32. 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, pages 178-194, 1993.