First-order verification of cryptographic protocols

Journal of Computer Security

Volumn 11, Issue 2, 2003, Pages 189-216

  Cohen, Ernie ^a,b  

^a MICROSOFT RESEARCH   (United Kingdom)

^b NONE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SOFTWARE; CRYPTOGRAPHY; DATA STORAGE EQUIPMENT; DISTRIBUTED COMPUTER SYSTEMS;

CENTRAL PROCESSING UNIT (CPU);

NETWORK PROTOCOLS;

EID: 0037271415     PISSN: 0926227X     EISSN: None     Source Type: Journal    
DOI: 10.3233/JCS-2003-11203     Document Type: Conference Paper

References (26)

1. G. Bella and L. Paulson, Mechanising BAN Kerberos by the inductive method, in: CAV 10, 1998, pp. 416-427.
2. G. Bella and L.C. Paulson, Kerberos version IV: Inductive analysis of the secrecy goals, in: ESORICS 5, 1998, pp. 361-375.
3. M. Bellaire and P. Rogaway, Entity authentication and key distribution (extended abstract), in: CRYPTO 13, 1993.
4. M. Bellare and P. Rogaway, Provably secure session key distribution: the three party case, in: STOC 27, 1995, pp. 57-66.
5. B. Blanchet, An efficient cryptographic prolotocol verifier based on prolog rules, in: CSFW 14, 2001.
6. M. Boreale, Symbolic analysis of cryptographic protocols in the spi-calculus, in: ICALP '01, 2001.
7. M. Burrows, M. Abadi and R. Needham, A logic of authentication, in: Practical Cryptography for Data Internetworks, IEEE Computer Society Press, 1996.
8. J. Clark and J. Jacob, A survey of authentication protocol literature: Version 1.0, 1997.
9. B. Donovan, P. Norris and G. Lowe, Analyzing a library of security protocols using Casper and FDR, in: Workshop on Formal Methods and Security Protocols, 1999.
10. F. Fabrega, J. Herzog and J. Guttman, Honest ideals in strand spaces, in: CSFW 11, 1998.
11. L. Gong, R. Needham and R. Yahalom, Reasoning about belief in cryptographic protocols, in: Proceedings 1990 IEEE Symposium on Research in Security and Privacy, 1990, pp. 234-248.
12. J. Heather, G. Lowe and S. Schneider, How to prevent type flaw attacks on security protocols, in: CSFW 13, 2000, pp. 255-268.
13. J. Heather and S. Schneider, Towards automatic verification of authentication protocols on an unbounded network, in: CSFW 13, 2000, pp. 132-143.
14. G. Lowe, Breaking and fixing the needham-schroeder public-key protocol using FDR, in: Tools and Algorithms for Construction and Analysis of Systems, 1996, pp. 147-166.
15. G. Lowe, Casper: A compiler for the analysis of security protocols, in: CSFW 10, 1997.
16. W. McCune, OTTER 3.0 reference manual and guide, Technical report, Argonne National Laboratory, 1994.
17. C. Meadows, Language generation and verification in the NRL protocol analyzer, in: CSFW 9, 1996, pp. 48-61.
18. C. Meadows, Invariant generation techniques in cryptographic protocol analysis, in: CSFW 13, 2000.
19. J.K. Millen, CAPSL: Common authentication protocol specification language, in: Proceedings on the Workshop on New Security Paradigms, 1997, pp. 132-133.
20. J. Mitchell, V. Shmatikov and U. Stern, Finite-state analysis of SSL 3.0, in: Proceedings of the Seventh USENIX Security Symposium, 1998, pp. 201-215.
21. L. Paulson, The inductive approach to verifying cryptographic protocols, JCS 6 (1998), 85-128.
22. S. Schneider, Verifying authentication protocols with CSP, in: CSFW 10, 1997.
23. D. Song, Athena: A new efficient automatic checker for security protocol analysis, in: CSFW 12, 1999.
24. T. Tammet, Gandalf, Journal of Automated Reasoning 18(2) (1997), 199-204.
25. C. Weidenbach, Towards an automatic analysis of security protocols in first-order logic, in: CADE 16, 1999.
26. C. Weidenbach, B. Afshordel, U. Brahm, C. Cohrs, T. Engel, E. Keen, C. Theobalt and D. Topić, System description: SPASS version 1.0.0, in: CADE 15, 1999, pp. 78-382.