Formalizing and analyzing the Needham-Schroeder symmetric-key protocol by rewriting

Electronic Notes in Theoretical Computer Science

Volumn 135, Issue 1, 2005, Pages 95-114

  Nesi, Monica ^a   Rucci, Giuseppina ^a  

^a UNIVERSITY OF L'AQUILA   (Italy)

Author keywords

Protocol verification; Rewriting strategy; Term rewriting; Tree automata

Indexed keywords

COMPUTER HARDWARE DESCRIPTION LANGUAGES; CRYPTOGRAPHY; KNOWLEDGE ENGINEERING; MATHEMATICAL MODELS; THEOREM PROVING;

PROTOCOL VERIFICATION; REWRITING STRATEGY; TERM REWRITING; TREE AUTOMATA;

NETWORK PROTOCOLS;

EID: 23144457408     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2005.06.002     Document Type: Conference Paper

References (37)

1. M. Abadi, and A.D. Gordon A Calculus for Cryptographic Protocols Journal of the ACM 148 1 1999 1 70
2. Armando, A., D. Basin, Y. Boichut, Y. Chevalier, L. Compagna, J. Cuellar, P.H. Drielsma. P.-C. Héam, J. Mantovani, S. Mödersheim, D. von Oheimb, M. Rusinowitch, J. Santiago, M. Turuani, L. Viganò and L. Vigneron, The AVISPA Tool for the Automated Validation of Internet Security Protocols and Applications, in Proceedings CAV 2005, Lecture Notes in Computer Science, Springer-Verlag, to appear
3. F. Baader, and T. Nipkow Term Rewriting and All That 1998 Cambridge University Press Cambridge
4. Basin, D., S. Mödersheim and L. Viganò, An On-The-Fly Model-Checker for Security Protocol Analysis, in Proceedings ESORICS 2003, Lecture Notes in Computer Science, Vol. 2808, Springer-Verlag, 253-270
5. S. Bistarelli, I. Cervesato, G. Lenzini, and F. Martinelli Relating Multiset Rewriting and Process Algebras for Security Protocol Analysis Journal of Computer Security 13 1 2005 3 47
6. Blanchet, B., From Secrecy to Authenticity in Security Protocols, in Proceedings SAS'02, Lecture Notes in Computer Science, Vol. 2477, Springer-Verlag, 342-359
7. Boichut, Y., P.-C. Héam, O. Kouchnarenko and F. Oehl, Improvements on the Genet and Klay Technique to Automatically Verify Security Protocols, in Proceedings 3rd International Workshop on Automated Verification of Infinite-State Systems (AVIS 2004), Barcelona, April 2004
8. M. Boreale, R. De Nicola, and R. Pugliese Proof Techniques for Cryptographic Processes SIAM Journal on Computing 31 3 2002 947 986
9. M. Buchholtz, H. Riis Nielson, and F. Nielson A Calculus for Control Flow Analysis of Security Protocols International Journal of Information Security 2 3-4 2004 145 167
10. I. Cervesato, N. Durgin, P.D. Lincoln, J.C. Mitchell, and A. Scedrov A Comparison between Strand Spaces and Multiset Rewriting for Security Protocol Analysis Journal of Computer Security 13 2 2005 265 316
11. Cirstea, H., Specifying Authentication Protocols Using Rewriting and Strategies, in Proceedings PADL 2001, Lecture Notes in Computer Science, Vol. 1990, Springer-Verlag, 138-152
12. H. Cirstea, C. Kirchner, L. Liquori, and B. Wack Rewrite Strategies in the Rewriting Calculus Final Proceedings WRS'03 Electronic Notes in Theoretical Computer Science 86 4 2003 URL http://www.sciencedirect.com/science/journal/ 15710661
13. H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi Tree Automata Techniques and Applications URL http://www.grappa.univ-lille3.fr/tata/
14. Denker, G., J. Meseguer and C. Talcott, Protocol Specification and Analysis in Maude, in Proceedings 2nd WRLA Workshop, Pont-à-Mousson, France, 1998
15. D. Denning, and G. Sacco Timestamps in key distributed protocols Communications of the ACM 24 8 1981 533 535
16. N. Dershowitz, and J.-P. Jouannaud Rewrite Systems J. van Leeuwen Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics 1990 North-Holland Amsterdam 243 320
17. Genet, T., Decidable Approximations of Sets of Descendants and Sets of Normal Forms, in Proceedings RTA 1998, Lecture Notes in Computer Science, Vol. 1379, Springer-Verlag, 151-165
18. Genet, T., and F. Klay, Rewriting for Cryptographic Protocol Verification, in Proceedings CADE 2000, Lecture Notes in Artificial Intelligence, Vol. 1831, Springer-Verlag, 271-290
19. Genet, T., and V. Viet Triem Tong, Reachability Analysis of Term Rewriting Systems with Timbuk, in Proceedings LPAR 2001, Lecture Notes in Artificial Intelligence, Vol. 2250, Springer-Verlag, 695-706
20. Inverardi, P., and M. Nesi, A Strategy to Deal with Divergent Rewrite Systems, in Proceedings CTRS 1992, Lecture Notes in Computer Science, Vol. 656, Springer-Verlag, 458-467
21. Inverardi, P., and M. Nesi, Semi-equational Rewriting for Divergent Rewrite Systems, Technical Report No. 113, Dept. of Pure and Applied Mathematics, University of L'Aquila, July 1996
22. B. Jacobs Semantics and Logic for Security Protocols Manuscript, September 2004, URL http://www.cs.ru.nl/B.Jacobs/PAPERS/protsemlog.pdf
23. Jacquemard, F., M. Rusinowitch and L. Vigneron, Compiling and Verifying Security Protocols, in Proceedings LPAR 2000, Lecture Notes in Artificial Intelligence, Vol. 1955, Springer-Verlag, 131-160
24. Lowe, G., Breaking and Fixing the Needham-Schroeder Public-Key Protocol using FDR, in Proceedings TACAS 1996, Lecture Notes in Computer Science, Vol. 1055, Springer-Verlag, 147-166
25. Lowe, G., A Family of Attacks upon Authentication Protocols, Technical Report 1997/5, Dept. of Mathematics and Computer Science, University of Leicester, January 1997
26. Meadows, C.A., Analyzing the Needham-Schroeder Public-Key Protocol: A Comparison of Two Approaches, in Proceedings ESORICS 1996, Lecture Notes in Computer Science, Vol. 1146, Springer-Verlag, 351-364.
27. Mitchell, J.C., M. Mitchell and U. Stern, Automated analysis of cryptographic protocols using Murphi, in Proceedings IEEE Symposium on Security and Privacy 1997, 141-153
28. Monniaux, D., Abstracting Cryptographic Protocols with Tree Automata, in Proceedings SAS 1999, Lecture Notes in Computer Science, Vol. 1694, Springer-Verlag, 149-163
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. R.M. Needham, and M.D. Schroeder Authentication revisited Operating Systems Review 21 7 1987
31. M. Nesi, G. Rucci, and M. Verdesca A Rewriting Strategy for Protocol Verification Final Proceedings WRS'03 Electronic Notes in Theoretical Computer Science 86 4 2003 URL http://www.sciencedirect.com/science/journal/15710661
32. Oehl, F., "Formal Verification of Cryptographic Protocols", Ph.D. Thesis, Dublin City University, School of Computing, 2005 (in preparation)
33. Oehl, F., and D. Sinclair, Combining two approaches for the verification of cryptographic protocols, in Proceedings Workshop on Specification, Analysis and Validation for Emerging Technologies in Computational Logic (SAVE 2001), Paphos, December 2001
34. Oehl, F., and D. Sinclair, Combining Isabelle and Timbuk for Cryptographic Protocol Verification, in Proceedings Workshop on Securité de la Communication sur Internet (SECI 2002), Tunis, September 2002, 57-67
35. L. Paulson Proving Properties of Security Protocols by Induction Proceedings 10th Computer Security Foundations Workshop 1997 IEEE Computer Society Press 70 83
36. L.C. Paulson The Inductive Approach to Verifying Cryptographic Protocols Journal of Computer Security 6 1998 85 128
37. Weidenbach, C., Towards an Automatic Analysis of Security Protocols in First-Order Logic, in Proceedings CADE 1999, Lecture Notes in Artificial Intelligence, Vol. 1632, Springer-Verlag, 314-328