MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  Using state space exploration and a natural deduction style message derivation engine to verify security protocols (1998) [54 citations — 4 self]

Download:
Download as a PDF | Download as a PS
by E. M. Clarke, S. Jha, W. Marrero
In Proc. IFIP Working Conference on Programming Concepts and Methods (PROCOMET
http://www.cs.cmu.edu/afs/cs.cmu.edu/user/marrero/www/procomet.ps.gz
Add To MetaCart

Abstract:

As more resources are added to computer networks, and as more vendors look to the World Wide Web as a viable marketplace, the importance of being able to restrict access and to insure some kind of acceptable behavior even in the presence of malicious adversaries becomes paramount. Many researchers have proposed the use of security protocols to provide these security guarantees. In this paper, we develop a method of verifying these protocols using a special purpose model checker which executes an exhaustive state space search of a protocol model. Our tool also includes a natural deduction style derivation engine which models the capabilities of the adversary trying to attack the protocol. Because our models are necessarily abstractions, we cannot prove a protocol correct. However, our tool is extremely useful as a debugger. We have used our tool to analyze 14 different authentication protocols, and have found the previously reported attacks for them.

Citations

947 A Logic for Authentication – Burrows, Abadi, et al. - 1990
703 On the security of public key protocols – Dolev, Yao - 1983
607 A Calculus for Cryptographic Protocols: The Spi Calculus – Abadi, Gordon - 1999
458 Breaking and Fixing the Needham-Schroeder Public-Key Protocol using FDR – Lowe - 1996
211 Automated Analysis of Cryptographic Protocols Using Murphi – Mitchell, Mitchell, et al. - 1997
200 The NRL protocol analyzer: An overview – Meadows - 1996
170 Provably secure session key distribution: the three party case – Bellare, Rogaway - 1995
155 A compiler for the analysis of security protocols – Casper - 1997
142 Proving properties of security protocols by induction – Paulson - 1997
110 A Semantic Model for Authentication Protocols – Woo, Lam - 1993
103 All from One, One for All: On Model Checking Using Representatives – Peled - 1993
101 Security properties and CSP – Schneider - 1996
68 Verifying Authentication Protocols withCSP – Schneider - 1997
65 A Model for Secure Protocols and Their Compositions – Heintze, Tygar - 1996
59 Model Checking for Security Protocols – Marrero, Clarke, et al. - 1997
59 Natural Deduction – Prawitz - 1971
44 Formal Verification of Cryptographic Protocols – Bolignano - 1996
39 A model of computation for the NRL protocolanalyzer – Meadows
39 Session Key Distribution Using Smart Cards – Shoup, Rubin - 1996
38 Intensional Specifications of Security Protocols – Roscoe - 1996
38 A lesson on authentication protocol design – Woo, Lam - 1994
28 Using temporal logic to specify and verify cryptographic protocols (progress report – Gray, McLean - 1995
25 Model checking electronic commerce protocols – Heintze, Tygar, et al. - 1996
25 The Interrogator model – Millen - 1995
22 automatic checking of security protocols – Fast - 1996
19 Accountability in electronic commerce protocols – Kailar - 1996
10 Specification and verification of a TTP protocol for the conditional access to services – Leduc, Bonaventure, et al. - 1996
5 Using EVES to analyze authentication protocols – Craigen, Saaltink - 1996