Timed spi-calculus with types for secrecy and authenticity

Lecture Notes in Computer Science

Volumn 3653, Issue , 2005, Pages 202-216

  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

FAILURE ANALYSIS; MATHEMATICAL MODELS; NETWORK PROTOCOLS; STANDARDS; TIME SHARING SYSTEMS;

AUTHENTICITY; DISCRETELY TIMED SPI-CALCULUS; DOLEV-YAO ATTACKER MODEL; GLOBAL CLOCKS;

SECURITY OF DATA;

EID: 27244455595     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11539452_18     Document Type: Conference Paper

References (22)

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 LNCS. 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. M. Abadi and R. Needham. Prudent engineering practice for cryptographic protocols. IEEE Transactions on Software Engineering, 22(1):6-15, 1996.
5. M. Burrows, M. Abadi, and R.M. Needham. A logic of authentication. Proceedings of the Royal Society of London A, 426:233-271, 1989.
6. J. Clark and J. Jacob. A survey of authentication protocol literature. Unpublished report. University of York, 1997.
7. G. Delzanno and P. Ganty. Automatic verification of time sensitive cryptographic protocols. In K. Jensen and A. Podelski, editors, Tools and Algorithms for the Construction and Analysis of Systems, volume 2988 of LNCS, pages 342-356. Springer, 2004.
8. D.E. Denning and G.M. Sacco. Timestamps in key distribution protocols. Communications of the ACM, 24(8):533-536, 1981.
9. N. Evans and S. Schneider. Analysing time dependent security properties in CSP using PVS. In F. Cuppens, Y. Deswarte, D. Gollmann, and M. Waidner, editors, ESORICS, volume 1895 of LNCS, pages 222-237. Springer, 2000.
10. 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.
11. A.D. Gordon and A.S.A. Jeffrey. Authenticity by typing for security protocols. J. Computer Security, 11(4):451-521, 2003.
12. A.D. Gordon and A.S.A. Jeffrey. Types and effects for asymmetric cryptographic protocols. J. Computer Security, 12(3/4):435-484, 2003.
13. A.D. Gordon and A.S.A. Jeffrey. Secrecy despite compromise: Types, cryptography and the pi-calculus. In CONCUR 2005: Concurrency Theory, LNCS. Springer, 2005.
14. R. Gorrieri, E. Locatelli, and F. Martinelli. A simple language for realtime cryptographic protocol analysis. In P. Degano, editor, 12th European Symposium on Programming, volume 2618 of LNCS, pages 114-128. Springer, 2003.
15. Joshua D. Guttman. Key compromise, strand spaces, and the authentication tests. Electr. Notes Theor. Comput. Sci., 45, 2001.
16. C. Haack and A.S.A. Jeffrey. Pattern-matching spi-calculus. In 2nd IFIP Workshop on Formal Aspects in Security and Trust, volume 173 of IFIP. Kluwer Academic Press, 2004.
17. J. Heather, G. Lowe, and S. Schneider. How to prevent type flaw attacks on security protocols. In 13th IEEE Computer Security Foundations Workshop, pages 255-268. IEEE Computer Society Press, 2000.
18. M. Hennessy and T. Regan. A process algebra for timed systems. Information and Computation, 117(2):221-239, 1995.
19. Y. Lakhnech L. Bozga, C. Ene. A symbolic decision procedure for cryptographic protocols with time stamps. In CONCUR 2004: Concurrency Theory, volume 3170 of LNCS, pages 177-192. Springer, 2004.
20. R.M. Needham and M.D. Schroeder. Using encryption for authentication in large networks of computers. Communications of the ACM, 21(12):993-999, 1978.
21. L.C. Paulson. The inductive approach to verifying cryptographic protocols. Journal of Computer Security, 6:85-128, 1998.
22. P. Ryan and S. Schneider. Modelling and Analysis of Security Protocols. Addison-Wesley, 2001.