Decidability of context-explicit security protocols

Journal of Computer Security

Volumn 13, Issue 1, 2005, Pages 135-165

  Ramanujam, R ^a   Suresh, S P ^b  

^a INSTITUTE OF MATHEMATICAL SCIENCES   (India)

^b CHENNAI MATHEMATICAL INSTITUTE   (India)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY CODES; CRYPTOGRAPHY; DATA COMMUNICATION SYSTEMS; DATA PRIVACY; NETWORK PROTOCOLS; SEMANTICS;

COMMUNICATION PATTERNS; INFINITE STATE SYSTEMS; SECURITY PROTOCOLS;

SECURITY OF DATA;

EID: 11944251803     PISSN: 0926227X     EISSN: None     Source Type: Journal    
DOI: 10.3233/JCS-2005-13106     Document Type: Conference Paper

References (25)

1. M. Abadi and R.M. Needham, Prudent engineering practices for cryptographic protocols, IEEE Transactions on Software Engineering 22 (1996), 6-15.
2. R.M. Amadio and W. Charatonik, On name generation and set-based analysis in Dolev-Yao model, in: CONCUR 2002, Volume 2421 of Lecture Notes in Computer Science, Springer, Berlin, 2002, pp. 499-514.
3. R.M. Amadio, D. Lugiez and V. Vanackère, On the symbolic reduction of processes with cryptographic functions, Theoretical Computer Science 290(1) (2002), 695-740.
4. R. Anderson and R.M. Needham, Programming Satan's computer, in: Computer Science Today, Volume 1000 of Lecture Notes in Computer Science, Springer, Berlin, 1995, pp. 426-441.
5. B. Blanchet and A. Podelski, Verification of cryptographic protocols: tagging enforces termination, in: Proceedings of FoSSaCS'03, A.D. Gordon, ed., Volume 2620 of Lecture Notes in Computer Science, Springer, Berlin, 2003, pp. 136-152.
6. I. Cervesato, C.A. Meadows and P.F. Syverson, Dolev-Yao is no better than Machiavelli, in: Proceedings of WITS'00, P. Degano, ed., 2000.
7. J. Clark and J. Jacob, A survey of authentication protocol literature, Electronic version available at http://www.cs.york.ac.uk./~jac, 1997.
8. H. Comon, V. Cortier and J.C. Mitchell, Tree automata with one memory, set constraints, and ping-pong protocols, in: Proceedings of ICALP 2001, Volume 2076 of Lecture Notes in Computer Science, Springer, Berlin, 2001.
9. D. Dolev, S. Even and R.M. Karp, On the security of ping-pong protocols, Information and Control 55 (1982), 57-68.
10. D. Dolev and A. Yao, On the security of public-key protocols, IEEE Transactions on Information Theory 29 (1983), 198-208.
11. N.A. Durgin, P.D. Lincoln, J.C. Mitchell and A. Scedrov, The undecidability of bounded security protocols, in: Proceedings of the Workshop on Formal Methods and Security Protocols (FMSP'99), 1999.
12. N. Heintze and D. Tygar, A model for secure protocols and their composition, IEEE Transactions on Software Engineering 22 (1996), 16-30.
13. ML. Hui and G. Lowe, Fault-preserving simplifying transformations for security protocols, Journal of Computer Security 9(1, 2) (2001), 3-46.
14. G. Lowe, Breaking and fixing the Needham-Schroeder public key protocol using FDR, in: Proceedings of TACAS'96, Volume 1055 of Lecture Notes in Computer Science, Springer, Berlin, 1996, pp. 147-166.
15. G. Lowe, Towards a completeness result for model checking of security protocols, Journal of Computer Security 7 (1999), 89-146.
16. J.K. Millen and V. Shmatikov, Constraint solving for bounded-process cryptographic protocol analysis, in: ACM Conference on Computer and Communications Security, 2001, pp. 166-175.
17. 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.
18. L.C. Paulson, The inductive approach to verifying cryptographic protocols, Journal of Computer Security 6 (1998), 85-128.
19. R. Ramanujam and S.P. Suresh, A decidable subclass of unbounded security protocols, in: Proceedings of WITS'03, R. Gorrieri, ed., 2003, pp. 11-20.
20. R. Ramanujam and S.P. Suresh, An equivalence on terms for security protocols, in: Proceedings of AVIS'03, R. Bharadwaj, ed., 2003, pp. 45-56.
21. R. Ramanujam and S.P. Suresh, Tagging makes secrecy decidable for unbounded nonces as well, in: Proceedings of 23rd FST&TCS, P.K. Pandya and J. Radhakrishnan, eds, Volume 2914 of Lecture Notes in Computer Science, Springer, Berlin, 2003, pp. 363-374.
22. R. Ramanujam and S.P. Suresh, Undecidability of secrecy for security protocols, Electronic version available at http://www.imsc.res.in/~jam, 2003.
23. M. Rusinowitch and M. Turuani, Protocol insecurity with finite number of sessions is NP-complete, Theoretical Computer Science, 299 (2003), 451-475.
24. S.P. Suresh, Foundations of security protocol analysis, PhD thesis, The Institute of Mathematical Sciences, Chennai, India, November 2003 (submitted to Madras University).
25. T.YC. Woo and S.S. Lam, A lesson on authentication protocol design, Operating Systems Review 28(3) (1994), 24-37.