Abstract
We propose a decision procedure, i.e. an inference system for clauses containing rigid and flexible variables. Rigid variables are only allowed to have one instantiation, whereas flexible variables are allowed as many instantiations as desired. We assume a set of clauses containing only rigid variables together with a set of clauses containing only flexible variables. When the flexible clauses fall into a particular class, we propose an inference system based on ordered resolution that is sound and complete and for which the inference procedure will halt.
An interest in this form of problem is for cryptographic protocol verification for a bounded number of protocol instances. Our class allows us to obtain a generic decidability result for a large class of cryptographic protocols that may use for instance CBC (Cipher Block Chaining) encryption and blind signature.
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
Andrews, P.: Theorem proving via general matings. Journal of the ACM 28(2), 193–214 (1981)
Bernat, V., Comon-Lundh, H.: Normal proofs in intruder theories. In: ASIAN 2006. Proc. of 11th Asian Computing Science Conference, Tokyo, Japan. LNCS, Springer, Heidelberg (2006)
Blanchet, B.: An efficient cryptographic protocol verifier based on prolog rules. In: CSFW 2001. Proc. of 14th Computer Security Foundations Workshop, Cape Breton (Canada), pp. 82–96. IEEE Computer Society Press, Los Alamitos (2001)
Chevalier, Y., Küsters, R., Rusinowitch, M., Turuani, M.: An NP decision procedure for protocol insecurity with XOR. In: LICS 2003. Proc. of 18th Annual IEEE Symposium on Logic in Computer Science, Ottawa (Canada), pp. 261–270. IEEE Computer Society Press, Los Alamitos (2003)
Comon-Lundh, H., Shmatikov, V.: Intruder deductions, constraint solving and insecurity decision in presence of exclusive or. In: LICS 2003. Proc. of 18th Annual IEEE Symposium on Logic in Computer Science, Ottawa (Canada), pp. 271–280. IEEE Computer Society Press, Los Alamitos (2003)
Cortier, V., Delaune, S., Lafourcade, P.: A survey of algebraic properties used in cryptographic protocols. Journal of Computer Security 14(1), 1–43 (2006)
Cortier, V., Rusinowitch, M., Zalinescu, E.: A resolution strategy for verifying cryptographic protocols with cbc encryption and blind signatures. In: PPDP 2005. Proc. of 7th ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming, Lisboa (Portugal), pp. 12–22. ACM Press, New York (2005)
Denning, D.E., Sacco, G.M.: Timestamps in key distribution protocols. Communications of the ACM 24(8), 533–536 (1981)
Deshane, T., Hu, W., Jablonski, P., Lin, H., Lynch, C., McGregor, R.E.: Encoding first order proofs in sat. In: Pfenning, F. (ed.) CADE 2007. LNCS, vol. 4603, pp. 476–491. Springer, Heidelberg (2007)
Dolev, D., Yao, A.: On the security of public key protocols. IEEE Transactions in Information Theory 2(29), 198–208 (1983)
Fujioka, A., Okamoto, T., Ohta, K.: A practical secret voting scheme for large scale elections. In: Zheng, Y., Seberry, J. (eds.) AUSCRYPT 1992. LNCS, vol. 718, pp. 244–251. Springer, Heidelberg (1993)
Goubault, J.: The complexity of resource-bounded first-order classical logic. In: Enjalbert, P., Mayr, E.W., Wagner, K.W. (eds.) STACS 94. LNCS, vol. 775, pp. 59–70. Springer, Heidelberg (1994)
Jacquemard, F., Rusinowitch, M., Vigneron, L.: Tree automata with equality constraints modulo equational theories. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol. 4130, pp. 557–571. Springer, Heidelberg (2006)
Kremer, S., Ryan, M.: Analysing the vulnerability of protocols to produce known-pair and chosen-text attacks. In: SecCo 2004. Proc. 2nd International Workshop on Security Issues in Coordination Models, Languages and Systems, London, UK. ENTCS, Elsevier Science Publishers, Amsterdam (2005)
Millen, J., Shmatikov, V.: Symbolic protocol analysis with an abelian group operator or Diffie-Hellman exponentiation. Journal of Computer Security 13(3), 515–564 (2005)
Needham, R., Schroeder, M.: Using encryption for authentification in large networks of computers. Communications of the ACM 21(12), 993–999 (1978)
Pereira, O., Quisquater, J.-J.: On the perfect encryption assumption. In: WITS 2000. Proc. of 1st Workshop on Issues in the Theory of Security, Geneva (Switzerland), pp. 42–45 (2000)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Delaune, S., Lin, H., Lynch, C. (2007). Protocol Verification Via Rigid/Flexible Resolution. In: Dershowitz, N., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2007. Lecture Notes in Computer Science(), vol 4790. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75560-9_19
Download citation
DOI: https://doi.org/10.1007/978-3-540-75560-9_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75558-6
Online ISBN: 978-3-540-75560-9
eBook Packages: Computer ScienceComputer Science (R0)