Selecting theories and nonce generation for recursive protocols

FMSE'07 - Proceedings of the 2007 ACM Workshop on Formal Methods in Security Engineering

Volumn , Issue , 2007, Pages 61-70

  Ole Kürtz, Klaas ^a   Küsters, Ralf ^b   Wilke, Thomas ^a  

^a UNIVERSITY OF KIEL   (Germany)

^b ETH ZURICH   (Switzerland)

Author keywords

Automatic analysis; Decidability; Security protocols

Indexed keywords

AUTHENTICATION PROTOCOLS; AUTOMATIC ANALYSIS; CRYPTOGRAPHIC PROTOCOLS; EXTENDED MODEL; FINITE NUMBER; RECURSIVE PROTOCOLS; SECURITY PROTOCOLS; SELECTING THEORIES; SESSION KEY;

COMPUTABILITY AND DECIDABILITY; CRYPTOGRAPHY; FORMAL METHODS; NETWORK PROTOCOLS; SECURITY SYSTEMS;

NETWORK SECURITY;

EID: 77952325597     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1314436.1314445     Document Type: Conference Paper

References (18)

1. J. Bull and D. Otway. The authentication protocol. Technical Report DRA/CIS3/PROJ/CORBA/SC/1/CSM/436-04/03, Defence Research Agency, Malvern, UK, 1997.
2. H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree Automata Techniques and Applications. Available on: http://www.grappa.univ-lille3.fr/tata, 1997. release October, 1rst 2002.
3. H. Comon-Lundh and V. Cortier. New Decidability Results for Fragments of First-order Logic and Application to Cryptographic Protocols. In Proceedings of the 14th Internatioinal Conference on Rewriting Techniques and Applications (RTA 2003), volume 2706 of Lecture Notes in Computer Science, pages 148-164. Springer, 2003.
4. D. Dolev and A. Yao. On the Security of Public-Key Protocols. IEEE Transactions on Information Theory, 29 (2):198-208, 1983.
5. N. Ferguson and B. Schneier. A Cryptographic Evaluation of IPsec. Technical report, 2000. Available from http://www.counterpane.com/ipsecpdf.
6. D. Harkins and D. Carrel. The Internet Key Exchange (IKE), November 1998. RFC 2409.
7. K. O. Kürtz. Selecting Theories and Nonce Generation for Recursive Protocols. Technical Report 0709, Institut für Informatik, CAU Kiel, Germany, 2007.
8. R. Küsters. On the Decidability of Cryptographic Protocols with Open-ended Data Structures. In L. Brim, P. Jancar, M. Kretinsky, and A. Kucera, editors, 13th International Conference on Concurrency Theory (CONCUR 2002), volume 2421 of Lecture Notes in Computer Science, pages 515-530. Springer-Verlag, 2002.
9. R. Küsters. On the Decidability of Cryptographic Protocols with Open-ended Data Structures. International Journal of Information Security, 4 (1-2): 49-70, 2005. Online publication appeared 2004. DOI: 10.1007/s10207-004- 0050-z. (Pubitemid 40347201)
10. R. Küsters and T. Wilke. Automata-based Analysis of Recursive Cryptographic Protocols. In V. Diekert and M. Habib, editors, 21st Symposium on Theoretical Aspects of Computer Science (STACS 2004), volume 2996 of Lecture Notes in Computer Science, pages 382-393. Springer-Verlag, 2004.
11. C. Meadows. Open issues in formal methods for cryptographic protocol analysis. In Proceedings of DISCEX 2000, pages 237-250. IEEE Computer Society Press, 2000.
12. J. Mongy. Transformation de noyaux reconnaissables d'arbres. Forêts RATEG. PhD thesis, LIF de Lille, Université des Sciences et Technologies de Lille, France, 1981.
13. D. Otway and O. Rees. Efficient and timely mutual authentication. Operating Systems Review, 21 (1):8-10, January 1987.
14. R. Küsters and T. Truderung. On the Automatic Analysis of Recursive Security Protocols with XOR. In W. Thomas and P. Weil, editors, Proceedings of the 24th Symposium on Theoretical Aspects of Computer Science (STACS 2007), volume 4393 of Lecture Notes in Computer Science. Springer, 2007.
15. T. Truderung. Regular protocols and attacks with regular knowledge. In R. Nieuwenhuis, editor, Proceedings of the 20th International Conference on Automated Deduction (CADE 2005), volume 3328 of Lecture Notes in Computer Science, pages 377-391. Springer-Verlag, 2005.
16. T. Truderung. Selecting theories and recursive protocols. In M. Abadi and L. de Alfaro, editors, Proceedings of the 16th International Conference on Concurrency Theory (CONCUR 2005), volume 3653 of Lecture Notes in Computer Science, pages 217-232. Springer-Verlag, 2005.
17. K. Verma, H. Seidl, and T. Schwentick. On the complexity of equational horn clauses. In Proceedings of the 20th International Conference on Automated Deduction (CADE 2005), volume 3328 of Lecture Notes in Computer Science, pages 337-352. Springer-Verlag, 2005.
18. J. Zhou. Fixing a security flaw in IKE protocols. Electronic Letter, 35 (13):1072-1073, 1999.