Tagging makes secrecy decidable with unbounded nonces as well

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

Volumn 2914, Issue , 2003, Pages 363-374

  Ramanujam, R ^a   Suresh, S P ^a  

^a INSTITUTE OF MATHEMATICAL SCIENCES   (India)

Author keywords

[No Author keywords available]

Indexed keywords

NETWORK SECURITY; SOFTWARE ENGINEERING;

SECURITY PROTOCOLS;

COMPUTABILITY AND DECIDABILITY;

EID: 35248886574     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24597-1_31     Document Type: Article

References (16)

1. Amadio, R.M., Lugiez, D. and Vanackèrc, V., "On the symbolic reduction of processes with cryptographic functions", INRIA Research Report 4147, March 2001.
2. Blanchet, B. and Podelski, P., "Verification of Cryptographic Protocols: Tagging Enforces Termination", In Goedon, A.D. ed. Proc. FoSSaCS'03, LNCS 2620, 2003, 136-152.
3. Comon-Lundh, H. and Cortier, V., "New decidability results for fragments of first-order logic and applications to cryptographic protocols", In Nieuwenhuis, R. ed. Proc. RTA'2003, LNCS 2706, 2003, 148-164.
4. Comon-Lundh, H., Cortier, V. and Mitchell, J.C., "Tree automata with One Memory, Set Constraints, and Ping-Pong Protocols", In Proc. ICALP 2001, LNCS 2076, 2001.
5. Clark, J. and Jacob, J., "A survey of authentication protocol literature", Electronic version available at http://www.cs.york.ac.uk./∼jac, 1997.
6. Dolev, D., Even, S. and Karp, R.M., "On the Security of Ping-Pong Protocols", In Information and Control, 55, 1982, 57-68.
7. Durgin, N.A., Lincoln, P.D., Mitchell, J.C. and Scedrov, A., "The undecidability of bounded security protocols", In Proc. FMSP'99, 1999.
8. Heather, J., Lowe, G. and Schneider, S. "How to Prevent Type Flaw Attacks on Security Protocols", In Proc. 13th IEEE CSFW, 2000, 255-268.
9. Heintze, N. and Tygar, D., "A model for secure protocols and their composition", In IEEE Transactions on Software Engineering, 22, 1996, 16-30.
10. Lowe, G., "Towards a completeness result for model checking of security protocols", In Journal of computer security, 7, 1999, 89-146.
11. Millen, J.K. and Shmatikov, V., "Constraint solving for bounded-process cryptographic protocol analysis", In Proc. ACM Conf. on Computer and Communications Security, 2001, 166-175.
12. Paulson, L.C., "The inductive approach to verifying cryptographic protocols", In Journal of computer security, 6, 1998, 85-128.
13. Ramanujam, R. and Suresh, S.P., "A decidable subclass of unbounded security protocols", In Gorrieri, R. ed. Proc. WITS'03, April 2003, 11-20.
14. Ramanujam, R. and Suresh, S.P., "An equivalence on terms for security protocols", In Bharadwaj, R. ed. Proc. AVIS'03, April 2003, 45-56.
15. Ramanujam, R. and Suresh, S.P., "Decidability of secrecy for tagged protocols", http://www.imsc.res.in/∼jam, September 2003.
16. Rusinowitch, M. and Turuani, M., "Protocol insecurity with finite number of sessions is NP-complete", In Proc. CSFW 14, 2001, 174-190.