The ρ-spi calculus at work: Authentication case studies

Electronic Notes in Theoretical Computer Science

Volumn 99, Issue , 2004, Pages 267-293

  Focardi, Riccardo ^a   Maffei, Matteo ^a  

^a CA' FOSCARI UNIVERSITY OF VENICE   (Italy)

Author keywords

Process Calculi; Security; Static Analysis

Indexed keywords

COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY; FORMAL LOGIC; NETWORK PROTOCOLS; SEMANTICS;

PROCESS CALCULI; SECURITY PROTOCOLS; SHARED KEY AUTHENTICATION; STATIC ANALYSIS;

SECURITY OF DATA;

EID: 18444408644     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2004.02.012     Document Type: Article

References (30)

1. M. Abadi. Secrecy by typing in security protocols. Journal of the ACM, 46(5):749-786, 1999.
2. M. Abadi and B. Blanchet. Analyzing Security Protocols with Secrecy Types and Logic Programs. In 29th Annual ACM SIGPLAN - SIGACT Symposium on Principles of Programming Languages (POPL 2002), pages 33-44, Portland, Oregon, January 2002. ACM Press.
3. M. Abadi and B. Blanchet. Secrecy types for asymmetric communication. Theor. Comput. Sci., 298(3):387-415, 2003.
4. M. Abadi and A. D. Gordon. A calculus for cryptographic protocols: The spi calculus. Information and Computation, 148(1):1-70, 1999.
5. R. Anderson and R. Needham. Programming satan's computer. In Jan van Leeuwen, editor, Computer Science Today - Recent Trends and Developments, volume 1000 of LNCS, pages 426-440, 1995.
6. C. Bodei, M. Buchholtz, P. Degano, F. Nielson, and H. Riis Nielson. Automatic validation of protocol narration. In In proceedings of 16th IEEE Computer Security Foundations Workshop (CSFW16), pages 126-140, June 2003.
7. M. Boreale. Symbolic trace analysis of cryptographic protocols. In Proceedings of lCALP 01, volume 2076, pages 667-681. LNCS 2076, Springer Verlag, 2001.
8. C. Boyd. Hidden assumptions in cryptographic protocols. IEEE Proceedings, Part E, pages 433-436, November 1990.
9. M. Bugliesi, R. Focardi, and M. Maffei. Principles for entity authentication. In Proceedings of 5th International Conference Perspectives of System Informatics (PSI 2003), volume 2890, pages 294-307, July 2003.
10. M. Bugliesi, R. Focardi, and M. Maffei. Compositional analysis of entity authentication protocols. In Proceedings of European Symposium on Programming (ESOP 2004), March 2004.
11. U.Carlsen. Optimal privacy and authentication on a portable communications system. Operating Systems Review, 28(3):16-23, July 1994.
12. J. Clark and J. Jacob. A survey of authentication protocol literature: Version 1.0. http://www.cs.york.ac.uk/~jac/papers/drareview.ps.gz, November 1997.
13. D. Denning and G. Sacco. Timestamps in key distributed protocols. Communication of the ACM, 24(8):533-535, 1981.
14. D. Dolev and A. Yao. On the security of public key protocols. IEEE Transactions on Information Theory, 29(2):198-208, 1983.
15. R. Focardi, R. Gorrieri, and F. Martinelli. Non interference for the analysis of cryptographic protocols. In Proceedings of ICALP'00, pages 354-372. Springer LNCS 1853, July 2000.
16. A. Gordon and A. Jeffrey. Authenticity by typing for security protocols. In 14th IEEE Computer Security Foundations Workshop (CSFW-14),pages 145-159, June 2001.
17. A. Gordon and A. Jeffrey. Types and effects for asymmetric cryptographic protocols. In 15th IEEE Computer Security Foundations Workshop - CSFW'01, pages 77-91. IEEE Computer Society Press, 24-26 June 2002.
18. J. Guttman. Security protocol design via authentication tests. In 15th IEEE Computer Security Foundations Workshop - CSFW'01, pages 92-103, Cape Breton, Canada, 24-26 June 2002. IEEE Computer Society Press.
19. Joshua D. Guttman and F. Javier Thayer. Authentication tests and the structure of bundles. Theoretical Computer Science, 283(2):333-380, 2002.
20. J. Heather, G. Lowe, and S. Schneider. How to prevent type flaw attacks on security protocols. In 13th IEEE Computer Security Foundations Workshop - CSFW'00, pages 255-268, Cambridge, UK, 3-5 July 2000. IEEE Computer Society Press.
21. ISO/IEC. Information Technology-Security Tecniques-Entity Authentication Mechanisms, Part 2:Entity Authentication using Simmetric Tecniques. 1993.
22. G. Lowe. Breaking and fixing the Needham-Schroeder public-key protocol using FDR. In Tools and Algorithms for the Construction and Analysis of Systems (TACAS), volume 1055, pages 147-166. Springer-Verlag, Berlin Germany, 1996.
23. G. Lowe and B. Roscoe. Using CSP to detect errors in the TMN protocol. IEEE Transaction on Software Engineering, 23(10):659-669, October 1997.
24. J. C. Mitchell, M. Mitchell, and U. Stern. Automated analysis of cryptographic protocols using muroφ. In Proceedings of the 1997 IEEE Symposium on Research in Security and Privacy, pages 141-153. IEEE Computer Society Press, 1997.
25. R M Needham and M D Schroeder. Authentication revisited. ACM SIGOPS Operating Systems Review, 21(1):7-7, 1987.
26. L. C. Paulson. The inductive approach to verifying cryptographic protocols. Journal of Computer Security, 6:85-128, 1998.
27. L. C. Paulson. Relations between secrets: Two formal analyses of the yahalom protocol. Journal of Computer Security, 9(3):197-216, 2001.
28. M.D. Schroeder R.M. Needham. Using encryption for authentication in large networks of computers. ACM Communication, 21(12):993-999, 1978.
29. Thomas Y. C. Woo and Simon S. Lam. A lesson on authentication protocol design. Operating Systems Review, 28(3):24-37, 1994.
30. T.Y.C. Woo and S.S. Lam. Authentication for distributed systems. IEEE Computer, 25(3):39-51, 1992.