A symbolic decision procedure for cryptographic protocols with time stamps

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

Volumn 3170, Issue , 2004, Pages 177-192

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

^a VERIMAG   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CRYPTOGRAPHIC PROTOCOLS; DECISION PROCEDURE; SYMBOLIC DECISION PROCEDURES; TIME STAMPS;

CRYPTOGRAPHY;

EID: 27244438198     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-28644-8_12     Document Type: Article

References (17)

1. G. Bella and L. G. Paulson. Mechanizing BAN Kerberos by the inductive method. In A. J. Hu and M. Y. Vardi, editors, Proceedings of the 10th International Conference on Computer-Aided Verification (CAV'98), pages 416-427, Vancouver, B.C., Canada, June 1998. Springer-Verlag LNCS 1427.
2. L. Bozga, C. Ene, and Y. Lakhnech. On the existence of an effective and complete proof system for bounded security protocols. In FOSSACS, vol. 2987. LNCS, 2004.
3. J. Clark and J. Joacob. A survey on authentication protocol. Available at the url http://www.cs.york.ac.uk/~jac/papers/drareviewps.ps, 1997.
4. Ernie Cohen. Taps: A first-order verifier for cryptographic protocols. In Proceedings of the 13th IEEE Computer Security Foundations Workshop (CSFW'00), page 144. IEEE Computer Society, 2000.
5. H. Comon. Disunification: A survey. In Computational Logic: Essays in Honor of Alan Robinson. MIT Press, Cambridge, MA, 1991.
6. G. Delzanno and P. Ganty. Automatic verification of time sensitive cryptographic protocols. In TACAS: International Workshop on Tools and Algorithms for the Construction and Analysis of Systems, LNCS, volume 2988, 2004.
7. D. Dolev and A. C. Yao. On the security of public key protocols. IEEE Transactions on Information Theory, 29(2):198-208, 1983.
8. Neil Evans and Steve Schneider. Analyzing time dependent security properties in CSP using PVS. In ESORICS, pages 222-237, 2000.
9. M. Fiore and M. Abadi. Computing symbolic models for verifying cryptographic protocols. In 14th IEEE Computer Security Foundations Workshop (CSFW '01), pages 160-173, Washington - Brussels - Tokyo, June 2001. IEEE.
10. Li Gong. A security risk of depending on synchronized clocks. Operating Systems Review, 26(1):49-53, 1992.
11. Roberto Gorrieri and Fabio Martinelli. A simple framework for real-time cryptographic protocol analysis with compositional proof rules. Science of Computer Programming, 50(1-3):23-49, 2004.
12. J.-P. Jouannaud and C. Kirchner. Solving equations in abstract algebras: A rule-based survey of unification. In Jean-Louis Lassez and Gordon Plotkin, editors, Computational Logic: Essays in Honor of Alan Robinson. MIT-Press, 1991.
13. G. Lowe. Breaking and fixing the Needham-Schroeder Public-Key protocol using FDR. In Tools and Algorithms for the Construction and Analysis of Systems, volume 1055 of LNCS, pages 147-166, 1996.
14. G. Lowe. A hierarchy of authentication specifications. In Proc. of The 10th Computer Security Foundations Workshop. IEEE Computer Society Press, 1997.
15. J. Millen and V. Shmatikov. Constraint solving for bounded-process cryptographic protocol analysis. In ACM Conference on Computer and Communications Security, pages 166-175, 2001.
16. M. Rusinowitch and M. Turuani. Protocol insecurity with finite number of sessions is NP-complete. In IEEE Computer Security Foundations Workshop, 2001.
17. J. Thayer, J. Herzog, and J. Guttman. Honest Ideals on Strand Spaces. In IEEE Computer Security Foundations Workshop, pages 66-78, 1998.