Automatic Verification of Time Sensitive Cryptographic Protocols

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

Volumn 2988, Issue , 2004, Pages 342-356

  Delzanno, Giorgio ^a,b   Ganty, Pierre ^a,b  

^a UNIVERSITY OF GENOA   (Italy)

^b UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

AUTHENTICATION;

ARBITRARY NUMBER; AUTOMATIC VERIFICATION; CRYPTOGRAPHIC PROTOCOLS; FIRST ORDER; FRESH NAMES; MULTISET REWRITING; TIME STAMPS;

CRYPTOGRAPHY;

EID: 35048864876     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24730-2_27     Document Type: Article

References (20)

1. R. Anderson, and R. Needham. Programming Satan's computer. Computer Science Today: 426-440, LNCS 1000, 1995.
2. G. Bella and L. C. Paulson. Kerberos version IV: inductive analysis of the secrecy goals. ESORICS '98: 361-375, 1998.
3. M. Burrows, M. Abadi, and R. Needham. A logic of authentication. ACM Trans. on Computer Systems, 8(1):18-36, 1990.
4. B. Blanchet. An efficient cryptographic protocol verifier based on prolog rules. CSFW '01: 82-96, 2001.
5. M. Bozzano and G. Delzanno. Beyond Parameterized Verification. TACAS '02, LNCS 2280: 221-235, 2002.
6. L. Bozga, Y. Lakhnech, and M. Périn. Pattern-based Abstraction for Verifying Secrecy in Protocols. TACAS '03, LNCS 2619: 299-314, 2003.
7. I. Cervesato, N. Durgin, P. Lincoln, J. Mitchell, and A. Scedrov. A meta-notation for Protocol Analysis. CSFW '99: 55-69, 1999.
8. E. Cohen. TAPS: A First-Order Verifier for Cryptographic Protocols. CSFW '00: 144-158, 2000.
9. N. Evans and S. Schneider. Analysing Time Dependent Security Properties in CSP Using PVS. ESORICS '00, LNCS 1895: 222-237, 2000.
10. T. Genet and F. Klay. Rewriting for Cryptographic Protocol Verification. CADE '00, LNCS 1831: 271-290, 2000.
11. G. Lowe. A Family of Attacks upon Authentication Protocols. Technical Report 1997/5, University of Leicester, 1997.
12. G. Lowe. A Hierarchy of Authentication Specifications. CSFW '97: 31-44, 1997.
13. G. Lowe. Casper: A compiler for the analysis of security protocols. CSFW '97: 18-30, 1997.
14. G. Lowe. Towards a completeness result for model checking of security protocols. J. of Computer Security, 7(2-3):89-146, 1998.
15. W. Marrero, E. Clarke, and S. Jha. Verifying Security Protocols with Brutus. ACM Trans. Softw. Eng. Methodol. 9(4): 443-487, 2000.
16. C. Meadows. The NRL protocol analyzer: An overview. J. of Logic Programming, 26(2):113-131, 1996.
17. J. Millen and V. Shmatikov. Constraint solving for bounded-process cryptographic protocol analysis. CCS '01: 166-175, 2001.
18. A. W. Roscoe and P. J. Broadfoot. Proving Security Protocols with Model Checkers by Data Independence Techniques. J. of Computer Security, 7(2,3):147-190, 1999.
19. D. X. Song. Athena. A New Efficient Automatic Checker for Security Protocol Analysis. CSFW '99: 192-202, 1999.
20. The MSR(C) home page: http://www.disi.unige.it/person/DelzannoG/MSR/