Abstract
With the development of network and distributed systems, more and more security protocols rely heavily on time stamps, which are taken into account by a few formal methods. Generally, these methods use constraints to describe the characteristic of time variables. However, few of them give a feasible solution to the corresponding constraints solving problem. An effective framework to model and verify time sensitive security protocols is introduced in [1], which doesn’t give an automatic algorithm for constraints solution. In this paper, an effective method is presented to determine whether the constraints system has a solution, and then implemented in our verifying tool SPVT. Finally, Denning-Sacco protocol is taken as an example to show that security protocols with time constraints can be modeled naturally and verified automatically and efficiently in our models.
Supported by the National Natural Science Foundation of China under Grant No. 60473057, 90604007.
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.
References
Zhou, T., Li, M.: 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)
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)
Gorrieri, R., Locatelli, E., Martinelli, F.: A simple language for real-time crypto- graphic 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 proto- col 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, USA (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 (extended abstract). 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., H.C.: Spvt: An efficient verification tool for security protocol. Chinese Journal of Software 17(4), 898–906 (2006)
Li, M., Li, Z., H.C.: Security protocol’s extended horn logic model and its verification method. Chinese Journal of Computers 29(9), 1667–1678 (2006)
Schrijver, A.: Theory of Linear and Integer Programming. John Wiley and Sons, Chichester (1986)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge, Massachusetts (2001)
Cohen, E., Megiddo, N.: Improved algorithms for linear inequalities with two variables per inequality. SIAM J. Comput. 23(6), 1313–1347 (1994)
Hochbaum, D.S., Naor, J.: Simple and fast algorithms for linear and integer pro- grams with two variables per inequality. SIAM J. Comput. 23(6), 1179–1192 (1994)
Shuang-yan, B., Jin-mei, G., Q.M.: An algorithm and example of solution to primary oriented circuits in a digraph. Journal of Changchun post and telecom- munication institute 17(2), 41–45 (1999)
Sewell, P.: Applied π– a brief tutorial. Technical Report UCAM-CL-TR-498, Computer Laboratory, University of Cambridge, p. 65 (2000)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, Z., Zhou, T., Li, M., Chen, H. (2007). Constraints Solution for Time Sensitive Security Protocols. In: Preparata, F.P., Fang, Q. (eds) Frontiers in Algorithmics. FAW 2007. Lecture Notes in Computer Science, vol 4613. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73814-5_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-73814-5_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73813-8
Online ISBN: 978-3-540-73814-5
eBook Packages: Computer ScienceComputer Science (R0)