A symbolic decision procedure for cryptographic protocols with time stamps

Journal of Logic and Algebraic Programming

Volumn 65, Issue 1, 2005, Pages 1-35

  Bozga, Liana ^a   Ene, Cristian ^a   Lakhnech, Yassine ^a  

^a VERIMAG   (France)

Author keywords

Cryptographic protocols; Security; Timed models; Verification

Indexed keywords

CLOCKS; CONSTRAINT THEORY; CRYPTOGRAPHY; LOGIC PROGRAMMING; MATHEMATICAL MODELS; TIME DOMAIN ANALYSIS;

CRYPTOGRAPHIC PROTOCOLS; SECURITY; TIMED MODELS; VERIFICATION;

DECISION THEORY;

EID: 24144457604     PISSN: 15678326     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jlap.2004.09.007     Document Type: Article

References (31)

1. R. Alur, and D. Dill A theory of timed automata Theoretical Computer Science 126 1994
2. R. Alur, T. Feder, T.A. Henzinger, The benefits of relaxing punctuality, in: Proceedings of the 10th ACM Symposium on Principles of Distributed Computing, ACM Press, 1991, pp. 139-152
3. R.M. Amadio, D.Lugiez, On the reachability problem in cryptographic protocols, in: International Conference on Concurrency Theory, LNCS, vol. 1877, 2000, pp. 380-394
4. G.Bella, L.C. Paulson, Mechanizing BAN Kerberos by the inductive method, in: A.J. Hu, M.Y. Vardi (Eds.), Proceedings of the 10th International Conference on Computer-Aided Verification (CAV'98), Vancouver, BC, Canada, June 1998, LNCS, Springer-Verlag, vol. 1427, pp. 416-427
5. M.Boreale, Symbolic trace analysis of cryptographic protocols, ICALP: Annual International Colloquium on Automata, Languages and Programming, 2001
6. A. Bouajjani, Y. Lakhnech, Temporal logic + timed automata: expressiveness and decidability, in: I. Lee, S.A. Smolka (Eds.), CONCUR'95: Concurrency Theory, LNCS, Springer-Verlag, vol. 962, 1995, pp. 531-546
7. L.Bozga, Automatic verification of cryptographic protocols, PhD thesis, University Joseph Fourier (Grenoble 1), 2004
8. M. Burrows, M. Abadi, and R. Needham A logic of authentication ACM Transactions on Computer Systems 8 1 1990 18 36
9. J.A. Clark, J.L. Jacob, A survey of authentication protocol literature, Version 1.0, Department of Computer Science, University of York, November 1997
10. Ernie Cohen, Taps: a first-order verifier for cryptographic protocols, in: Proceedings of the 13th IEEE Computer Security Foundations Workshop (CSFW'00), IEEE Computer Society, 2000, p. 144
11. H. Comon Disunification a survey Computational Logic: Essays in Honor of Alan Robinson 1991. MIT Press Cambridge, MA
12. H. Comon, and V. Shmatikov Is it possible to decide whether a cryptographic protocol is secure or not? Journal of Telecommunications and Information Technology 2002
13. H. Comon-Lundh, V. Cortier, New decidability results for fragments of first-order logic and application to cryptographic protocols, in: 14th Int. Conf. Rewriting Techniques and Applications (RTA'2003), LNCS, vol. 2706, 2003
14. V. Cortier, J. Millen, and H. Rueß Proving secrecy is easy enough IEEE Computer Security Foundations Workshop 2001 97 110
15. D. Dolev, and A.C. Yao On the security of public key protocols IEEE Transactions on Information Theory 29 2 1983 198 208
16. Neil Evans, and Steve Schneider Analyzing time dependent security properties in CSP using PVS ESORICS 2000 222 237
17. M. Fiore, M. Abadi, Computing symbolic models for verifying cryptographic protocols, in: 14th IEEE Computer Security Foundations Workshop (CSFW '01), Washington-Brussels-Tokyo, June 2001, IEEE, pp. 160-173
18. Li Gong A security risk of depending on synchronized clocks Operating Systems Review 26 1 1992 49 53
19. T.A. Henzinger, X. Nicollin, J. Sifakis, S. Yovine, Symbolic model-checking for real-time systems, in: Seventh Annual IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press, 1992, pp. 394-406
20. J.P. Jouannaud, and C. Kirchner Solving equations in abstract algebras: a rule-based survey of unification Jean-Louis Lassez Gordon Plotkin Computational Logic Essays in Honor of Alan Robinson 1991. MIT Press
21. G. Lowe, Breaking and fixing the Needham-Schroeder Public-Key protocol using FDR, in: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 1055, 1996, pp. 147-166
22. G. Lowe. A hierarchy of authentication specifications, in: 10th IEEE Computer Security Foundations Workshop (CSFW '97), Washington-Brussels-Tokyo, June 1997, IEEE, pp. 31-44
23. J. Millen, and V. Shmatikov Constraint solving for bounded-process cryptographic protocol analysis ACM Conference on Computer and Communications Security 2001 166 175
24. L. Paulson Proving properties of security protocols by induction IEEE Computer Security Foundations Workshop 1997 70 83
25. A.W. Roscoe. Intensional specification of security protocols, in: 9th IEEE Computer Security Foundations Workshop (CSFW '96), Washington-Brussels- Tokyo, June 1996, IEEE, pp. 28-38
26. M. Rusinowitch, and M. Turuani Protocol insecurity with finite number of sessions is NP-complete IEEE Computer Security Foundations Workshop 2001.
27. S. Schneider, Verifying authentication protocols with CSP, in: 10th IEEE Computer Security Foundations Workshop (CSFW '97), Washington-Brussels-Tokyo, June 1997, IEEE, pp. 3-17
28. Alexander Schrijver Theory of Linear and Integer Programming 1986. John Wiley Chichester
29. J. Thayer, J. Herzog, and J. Guttman Honest ideals on strand spaces IEEE Computer Security Foundations Workshop 1998 66 78
30. K.N. Venkataraman Decidability of the purely existential fragment of the theory of term algebras JACM 1987.
31. T.Y.C. Woo, and S.S. Lam Authentication for distributed systems Computer 25 1 1992 39 52