On the automatic analysis of recursive security protocols with XOR

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4393 LNCS, Issue , 2007, Pages 646-657

  Küsters, Ralf ^a   Truderung, Tomasz ^b  

^a ETH ZURICH   (Switzerland)

^b UNIVERSITY OF KIEL   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; DECISION THEORY; NUMBER THEORY; RECURSIVE FUNCTIONS; SECURITY OF DATA;

HORN THEORIES; RECURSIVE COMPUTATIONS; RECURSIVE SECURITY PROTOCOLS;

NETWORK PROTOCOLS;

EID: 35548966087     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70918-3_55     Document Type: Conference Paper

References (16)

1. J.A. Bull and D.J. Otway. The authentication protocol. Technical Report DRA/CIS3/PROJ/CORBA/SC/1/CSM/436-04/03, Defence Research Agency, Malvern, UK, 1997.
2. Y. Chevalier, R. Küsters, M. Rusinowitch, and M. Turuani. An NP Decision Procedure for Protocol Insecurity with XOR. In LICS 2003, pages 261-270. IEEE, Computer Society Press, 2003.
3. Y. Chevalier, R. Küsters, M. Rusinowitch, and M. Turuani. Deciding the Security of Protocols with Diffie-Hellman Exponentiation and Products in Exponents. In FSTTCS 2003, volume 2914 of LNCS, pages 124-135. Springer, 2003.
4. Y. Chevalier, R. Küsters, M. Rusinowitch, and M. Turuani. Deciding the Security of Protocols with Commuting Public Key Encryption. ENTCS, 125(1):55-66, 2005.
5. H. Comon-Lundh and V. Cortier. New Decidability Results for Fragments of First-order Logic and Application to Cryptographic Protocols. In RTA 2003, volume 2706 of LNCS, pages 148-164. Springer, 2003.
6. H. Comon-Lundh and V. Shmatikov. Intruder deductions, constraint solving and insecurity decision in presence of exclusive or. In LICS 2003, pages 271-280. IEEE, Computer Society Press, 2003.
7. V. Cortier, S. Delaune, and P. Lafourcade. A survey of algebraic properties used in cryptographic protocols. Journal of Computer Security, 14(1):1-43, 2006.
8. 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.
9. R. Küsters and T. Truderung On the Automatic Analysis of Recursive Security Protocols with XOR. Technial Report, 2007. Available from http://people.inf.ethz.ch/kuestral/publications_html/KuestersTruderung-TR-STACS- 2007.pdf.
10. R. Küsters and T. Wilke. Automata-based Analysis of Recursive Cryptographic Protocols. In STAGS 2004, volume 2996 of LNCS, pages 382-393. Springer, 2004.
11. L.C. Paulson. Mechanized Proofs for a Recursive Authentication Protocol. In CSFW-10, pages 84-95. IEEE Computer Society Press, 1997.
12. O. Pereira and J.-J. Quisquater. A Security Analysis of the Cliques Protocols Suites. In CSFW-14, pages 73-81, IEEE Computer Society Press, 2001.
13. P.Y.A. Ryan and S.A. Schneider. An Attack on a Recursive Authentication Protocol. Information Processing Letters, 65(1):7-10, 1998.
14. V. Shmatikov. Decidable Analysis of Cryptographic Protocols with Products and Modular Exponentiation. In (ESOP 2004), volume 2986 of LNCS, pages 355-369. Springer, 2004.
15. T. Truderung. Selecting theories and recursive protocols. In CONCUR 2005, volume 3653 of LNCS, pages 217-232. Springer, 2005.
16. K.N. Verma, H. Seidl, and T. Schwentick. On the complexity of equational horn clauses. In CADE 2005, volume 3328 of LNCS, pages 337-352. Springer, 2005.