Pattern-matching spi-calculush

IFIP Advances in Information and Communication Technology

Volumn 173, Issue , 2005, Pages 55-70

  Haack, Christian ^a   Jeffrey, Alan ^a,b  

^a DEPAUL UNIVERSITY   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS;

COMPLEX DATA; CRYPTOGRAPHIC PRIMITIVES; CRYPTOGRAPHIC PROTOCOLS; MESSAGE DIGESTS; SAFETY PROPERTY; SPI CALCULUS; TYPE SYSTEMS;

CRYPTOGRAPHY;

EID: 84902449094     PISSN: 18684238     EISSN: None     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (23)

1. M. Abadi. Secrecy by typing in security protocols. Journal of the ACM, 46(5):749-786, September 1999.
2. 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.
3. M. Abadi and A.D. Gordon. A calculus for cryptographic protocols: The spi calculus. Information and Computation, 148:1-70, 1999.
4. C. Bodei, M. Buchholtz, P. Degano, F. Nielson, and H. Riis Nielson. Automatic validation of protocol narration. In Proc. CSFÏV03, pages 126-140. IEEE Press, 2003.
5. D. Bolignano. An approach to the formal verification of cryptographic protocols. In Third ACM Conference on Computer and Communications Security, pages 106-118,1996.
6. M. Burrows, M. Abadi, and R.M. Needham. A logic of authentication. Proceedings of the Royal Society of London A, 426:233-271, 1989.
7. 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.
8. I. Cervesato, N. A. Durgin, P. D. Lincoln, J. C. Mitchell, and A. Scedrov. A meta-notation for protocol analysis. In Proc. IEEE Computer Security Foundations Workshop, pages 55-69, 1999.
9. E. Cohen. TAPS: A first-order verifier for cryptographic protocols. In 13th IEEE Computer Security Foundations Workshop, pages 144-158. IEEE Computer Society Press, 2000.
10. D. Dolev and A.C. Yao. On the security of public key protocols. IEEE Transactions on Information Theory, IT-29(2): 198-208, 1983.
11. A. D. Gordon and A. S. A. Jeffrey. Typing one-to-one and one-to-many correspondences in security protocols. In Proc. Int. Software Security Symp., volume 2609 of Lecture Notes in Computer Science, pages 263-282. Springer-Verlag, 2002.
12. A.D. Gordon and A. Jeffrey. Authenticity by typing for security protocols. In Nth IEEE Computer Security Foundations Workshop, pages 145-159. IEEE Computer Society Press, 2001.
13. 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.
14. C. Haack and A. S. A. Jeffrey. Pattern-matching spi-calculus (longer draft). Available from http://fpl.cs.depaul.edu/ajeffrey/fast04Long.pdf. 2004.
15. J. Heather. 'Oh!. Is it really you?' Using rank functions to verify authentication protocols. PhD thesis, Royal Holloway, University of London, 2000.
16. J. Heather and S. Schneider. Towards automatic verification of authentication protocols on an unbounded network. In 13th IEEE Computer Security Foundations Workshop, pages 132-143. IEEE Computer Society Press, 2000.
17. 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, pages 147-166. Springer, 1996.
18. W. Marrero, E.M. Clarke, and S. Jha. Model checking for security protocols. In D1MACS 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.
19. L.C. Paulson. The inductive approach to verifying cryptographic protocols. Journal of Computer Security, 6:85-128, 1998.
20. A.W. Roscoe. Modelling and verifying key-exchange protocols using CSP and FDR. In 8th IEEE Computer Security Foundations Workshop, pages 98-107. IEEE Computer Society Press, 1995.
21. S.A. Schneider. Verifying authentication protocols in CSP. IEEE Transactions on Software Engineering, 24(9):741-758, 1998.
22. F.J. Thayer Fábrega, J.C. Herzog, and J.D. Guttman. Strand spaces: Why is a security protocol correct? In IEEE Computer Society Symposium on Research in Security and Privacy, pages 160-171, 1998.
23. 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.