Selecting theories and recursive protocols

Lecture Notes in Computer Science

Volumn 3653, Issue , 2005, Pages 217-232

  Truderung, Tomasz ^a,b  

^a LORIA   (France)

^b UNIVERSITY OF WROC AW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; CRYPTOGRAPHY; MATHEMATICAL MODELS; MATHEMATICAL TECHNIQUES; SECURITY OF DATA; TRANSDUCERS;

NON-RECURSIVE CRYPTOGRAPHIC PROTOCOLS; RECURSIVE COMPUTATIONS; RECURSIVE PROTOCOLS; SELECTING THEORIES;

NETWORK PROTOCOLS;

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

References (17)

1. Roberto M. Amadio and Witold Charatonik, On name generation and set-based analysis in the Dolev-Yao model, CONCUR, Lecture Notes in Computer Science, vol. 2421, Springer, 2002, pp. 499-514.
2. G. Ateniese, M. Steiner, and G. Tsudik, Authenticated group key agreement and friends, Proceedings of the 5th ACM Conference on Computer and Communication Serucity (CCS'98), ACM Press, 1998.
3. J. Bryans and S.A. Schneider, CSP, PVS, and a recursive authentication protocol, DIMACS Workshop on Formal Verification of Security Protocols, 1997.
4. 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.
5. Y. Chevalier, R. Küsters, M. Rusinowitch, and M. Turuani, Deciding the security of protocols with Diffie-Hellman exponentiation and products in exponents, FSTTCS, 2003.
6. _, An NP decision procedure for protocol insecurity with XOR, LICS, 2003.
7. H. Comon and V. Shmatikov, Is it possible to decide whether a cryptographic protocol is secure or not?, Journal of Telecommunications and Information Technology, special issue on cryptographic protocol verification 4 (2002), 5-15.
8. H. Comon-Lundh and V. Shmatikov, Intruder deductions, constraint solving and indecurity decision in presence of exclusive or, LICS, 2003.
9. D. Dolev and A.C. Yao, On the security of public-key protocols, IEEE Transactions on Information Theory 29 (1983), 198-208.
10. N.A. Durgin, P.D. Lincoln, J.C. Mitchell, and A. Scedrov, Undecidability of bounded security protocols, Workshop on Formal Methods and Security Protocols (FMSP'99), 1999.
11. S. Even and O. Goldreich, On the security of multi-party ping-pong protocols. Technical Report 285, Israel Institute of Technology, 1983.
12. Ralf Küsters and Thomas Wilke, Automata-based analysis of recursive cryptographic protocols, Technical Report IFI 0311, CAU Kiel, 2003.
13. _, Automata-based analysis of recursive cryptographic protocols, STACS, Lecture Notes in Computer Science, vol. 2996, Springer, 2004, pp. 382-393.
14. Catherine Meadows, Formal methods for cryptographic protocol analysis: Emerging issues and trends, IEEE Journal on Selected Areas in Communication 21 (2003), no. 1, 44-54.
15. L.C. Paulson, Mechanized proofs for a recursive authentication protocol, 10th IEE Computer Security Foundations Workshop (CSFW-10), IEEE Press, 1997.
16. Michael Rusinowitch and Mathieu Turuani, Protocol insecurity with a finite number of sessions, composed keys is NP-complete, Theor. Comput. Sci. 1-3 (2003), no. 299, 451-475.
17. Tomasz Truderung, Regular protocols and attacks with regular knowledge. Proceedings of CADE 2005, LNCS, Springer, 2005, to appear.