Abstract
We investigate the applicability of symbolic exploration to the automatic verification of secrecy and authentication properties for time sensitive cryptographic protocols. Our formal specifications are given in multiset rewriting over first order atomic formulas enriched with constraints so as to uniformly model fresh name generation and validity condition of time stamps. Our verification approach is based on data structures for symbolically representing sets of configurations of an arbitrary number of parallel protocol sessions. As a case study we discuss the verification of timed authentication for the Wide Mouth Frog protocol.
This work was partially funded by the Information Society Technologies programme of the European Commission, Future and Emerging Technologies under the IST-2001-39252 AVISPA project.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Anderson, R., Needham, R.: Programming Satan’s computer. In: van Leeuwen, J. (ed.) Computer Science Today. LNCS, vol. 1000, pp. 426–440. Springer, Heidelberg (1995)
Bella, G., Paulson, L.C.: Kerberos version IV: inductive analysis of the secrecy goals. In: Quisquater, J.-J., Deswarte, Y., Meadows, C., Gollmann, D. (eds.) ESORICS 1998. LNCS, vol. 1485, pp. 361–375. Springer, Heidelberg (1998)
Burrows, M., Abadi, M., Needham, R.: A logic of authentication. ACM Trans. on Computer Systems 8(1), 18–36 (1990)
Blanchet, B.: An efficient cryptographic protocol verifier based on prolog rules. In: CSFW 2001, pp. 82–96 (2001)
Bozzano, M., Delzanno, G.: Beyond Parameterized Verification. In: Katoen, J.-P., Stevens, P. (eds.) TACAS 2002. LNCS, vol. 2280, pp. 221–235. Springer, Heidelberg (2002)
Bozga, L., Lakhnech, Y., Périn, M.: Pattern-based Abstraction for Verifying Secrecy in Protocols. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol. 2619, pp. 299–314. Springer, Heidelberg (2003)
Cervesato, I., Durgin, N., Lincoln, P., Mitchell, J., Scedrov, A.: A meta-notation for Protocol Analysis. In: CSFW 1999, pp. 55–69 (1999)
Cohen, E.: TAPS: A First-Order Verifier for Cryptographic Protocols. In: CSFW 2000, pp. 144–158 (2000)
Evans, N., Schneider, S.: Analysing Time Dependent Security Properties in CSP Using PVS. In: Cuppens, F., Deswarte, Y., Gollmann, D., Waidner, M. (eds.) ESORICS 2000. LNCS, vol. 1895, pp. 222–237. Springer, Heidelberg (2000)
Genet, T., Klay, F.: Rewriting for Cryptographic Protocol Verification. In: McAllester, D. (ed.) CADE 2000. LNCS, vol. 1831, pp. 271–290. Springer, Heidelberg (2000)
Lowe, G.: A Family of Attacks upon Authentication Protocols. Technical Report 1997/5, University of Leicester (1997)
Lowe, G.: A Hierarchy of Authentication Specifications. In: CSFW 1997, pp. 31–44 (1997)
Lowe, G.: Casper: A compiler for the analysis of security protocols. In: CSFW 1997, pp. 18–30 (1997)
Lowe, G.: Towards a completeness result for model checking of security protocols. J. of Computer Security 7(2-3), 89–146 (1998)
Marrero, W., Clarke, E., Jha, S.: Verifying Security Protocols with Brutus. ACM Trans. Softw. Eng. Methodol. 9(4), 443–487 (2000)
Meadows, C.: The NRL protocol analyzer: An overview. J. of Logic Programming 26(2), 113–131 (1996)
Millen, J., Shmatikov, V.: Constraint solving for bounded-process cryptographic protocol analysis. In: CCS 2001, pp. 166–175 (2001)
Roscoe, W., Broadfoot, P.J.: Proving Security Protocols with Model Checkers by Data Independence Techniques. J. of Computer Security 7(2,3), 147–190 (1999)
Song, D.X.: Athena. A New Efficient Automatic Checker for Security Protocol Analysis. In: CSFW 1999, pp. 192–202 (1999)
The MSR(C) home page: http://www.disi.unige.it/person/DelzannoG/MSR/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Delzanno, G., Ganty, P. (2004). Automatic Verification of Time Sensitive Cryptographic Protocols. In: Jensen, K., Podelski, A. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2004. Lecture Notes in Computer Science, vol 2988. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24730-2_27
Download citation
DOI: https://doi.org/10.1007/978-3-540-24730-2_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21299-7
Online ISBN: 978-3-540-24730-2
eBook Packages: Springer Book Archive