Abstract
This paper incorporates time constraints in the Horn logic model, and this extended model can verify Wide-Mouthed-Frog protocol quickly. It discusses relations between the constraint system and Horn model, abstracts the constraint system, and gives the proofs of some propositions and theorems. We also give the algorithm about how to compute the abstract constraint, and analyze its complexity. As a case study we discuss the verification of Wide-Mouthed-Frog protocol whose attack can be found quickly in new model. Therefore, the method in this paper is very effective in verification of time sensitive security protocols. In the future, we will use this method to verify some complex protocols, such as Kerberos protocol etc.
Supported by the National Natural Science Foundation of China under Grant No. 60473057, 90604007, 60703075, 90718017, the National High Technology Research and Development Program of China No. 2007AA010301, and the Research Fund for the Doctoral Program of Higher Education No. 20070006055.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Anderson, R.J., Needham, R.M.: Programming Satan’s computer. In: van Leeuwen, J. (ed.) Computer Science Today. LNCS, vol. 1000, pp. 426–440. Springer, Heidelberg (1995)
Clark, J.A., Jacob, J.L.: A survey of authentication protocol literature. Technical Report 1.0 (1997)
Dolev, D., Yao, A.C.: On the security of public key protocols. Technical report, Stanford, CA, USA (1981)
Dolev, D., Yao, A.: On the security of public key protocols. IEEE Transactions on Information Theory 29(2), 198–208 (1983)
Zhou, T., Li, M., Li, Z., Chen, H.: Verification of time sensitive security protocols based on the extended horn logic model. Chinese Journal of Computer Research and Development 43(suppl.2), 534–540 (2006)
Lowe, G.: Casper: A compiler for the analysis of security protocols. In: 10th IEEE Computer Security Foundations Workshop (CSFW-10), pp. 18–30 (1997)
Lowe, G.: A hierarchy of authentication specifications. In: 10th IEEE Computer Security Foundations Workshop (CSFW-10), pp. 31–44 (1997)
Evans, N., Schneider, S.: Analysing time dependent security properties in CSP using PVS. In: ESORICS, pp. 222–237 (2000)
Gorrieri, R., Locatelli, E., Martinelli, F.: A Simple Language for Real-Time Cryptographic Protocol Analysis. In: Degano, P. (ed.) ESOP 2003 and ETAPS 2003. LNCS, vol. 2618, pp. 114–128. Springer, Heidelberg (2003)
Gorrieri, R., Martinelli, F.: A simple framework for real-time cryptographic protocol analysis with compositional proof rules. Sci. Comput. Program. 50(1-3), 23–49 (2004)
Corin, R., Etalle, S., Hartel, P.H., Mader, A.: Timed model checking of security protocols. In: FMSE 2004: Proceedings of the 2004 ACM workshop on Formal methods in security engineering, pp. 23–32. ACM Press, New York (2004)
Delzanno, G., Ganty, P.: Automatic Verification of Time Sensitive Cryptographic Protocols. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol. 2988, pp. 342–356. Springer, Heidelberg (2004)
Bozga, L., Ene, C., Lakhnech, Y.: A Symbolic Decision Procedure for Cryptographic Protocols with Time Stamps. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 177–192. Springer, Heidelberg (2004)
Abadi, M., Blanchet, B.: Analyzing security protocols with secrecy types and logic programs. In: Symposium on Principles of Programming Languages, pp. 33–44 (2002)
Blanchet, B.: An efficient cryptographic protocol verifier based on prolog rules. In: 14th IEEE Computer Security Foundations Workshop (CSFW-14), pp. 82–96 (2001)
Blanchet, B.: From Secrecy to Authenticity in Security Protocols. In: Hermenegildo, M.V., Puebla, G. (eds.) SAS 2002. LNCS, vol. 2477, pp. 342–359. Springer, Heidelberg (2002)
Li, M., Li, Z., Chen, H.: Security protocol’s extended horn logic model and its verification method. Chinese Journal of Computers 29(9), 1667–1678 (2006)
Li, M., Li, Z., Chen, H.: Spvt: An efficient verification tool for security protocol. Chinese Journal of Software 17(4), 898–906 (2006)
Li, Z., Zhou, T., Li, M., Chen, H.: Constraints Solution for Time Sensitive Security Protocols. In: Preparata, F.P., Fang, Q. (eds.) FAW 2007. LNCS, vol. 4613, pp. 191–203. Springer, Heidelberg (2007)
Delzanno, G.: Automatic of secrecy and authentication in unbound models of cryptographic protocols with fresh nonce generation and time-stamps(draft) (2003)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhou, T., Li, Z., Li, M., Chen, H. (2008). Constraint Abstraction in Verification of Security Protocols. In: Preparata, F.P., Wu, X., Yin, J. (eds) Frontiers in Algorithmics. FAW 2008. Lecture Notes in Computer Science, vol 5059. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69311-6_27
Download citation
DOI: https://doi.org/10.1007/978-3-540-69311-6_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69310-9
Online ISBN: 978-3-540-69311-6
eBook Packages: Computer ScienceComputer Science (R0)