Abstract
The formal verifiation of security properties of a cryptographic protocol is a diffcult, albeit very important task as more and more sensible resources are added to public networks. This paper is focused on model checking; when adopting this approach to the problem, one challenge is to represent the intruder’s knowledge in an effective way. We present an intruder’s knowledge representation strategy that supports the full term language of spi calculus and does not pose arti.- cial restrictions, such as atomicity or limited maximum size, to language elements. In addition, our approach leads to practical implementation because the knowledge representation is incrementally computable and is easily amenable to work with various term representation languages.
Chapter PDF
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
M. Abadi, and A. D. Gordon, “A Calculus for Cryptographic Protocols The Spi Calculus”, Digital Research Report, vol. 149, January 1998, pp. 1–110.
R. Amadio, and D. Lugiez, “On the Reachability Problem in Cryptographic Protocols”, Proc. of CONCUR’2000, LNCS 1877, pp. 380–394, Springer-Verlag, 2000.
M. Boreale, R. De Nicola, and R. Pugliese, “Proof Techniques for Cryptographic Processes”, Proc. of the 14th IEEE Symposium Logic In Computer Science (LICS’99), IEEE Computer Society Press, pp. 157–166, 1999.
M. Boreale, “Symbolic Trace Analysis of Cryptographic Protocols”, In Proc. 28th ICALP, Vol. 2076 of Lecture Notes in Computer Science, Springer-Verlag, pp. 667–681, 2001.
E. M. Clarke, S. Jha, and W. Marrero, “Using state space exploration and a natural deduction style message derivation engine to verify security protocols”, Proc. of IFIP PROCOMET, Chapman & Hall, London, 1998, pp. p.87–106.
E. M. Clarke, S. Jha, and W. Marrero, “Verifying security protocols with Brutus”, ACM Trans. on Software Engineering and Methodology Vol. 9, No. 4, October 2000, pp. 443–487.
D. Dolev, and A. Yao, “On the security of public key protocols”, IEEE Transactions on Information Theory, 29(2):198–208, 1983.
L. Durante, R. Sisto, and A. Valenzano, “A state-exploration technique for spicalculus testing equivalence verification”, Proc. of FORTE/PSTV 2000, Pisa, October 2000, pp. 155–170.
L. Durante, R. Sisto, and A. Valenzano, “Automatic testing equivalence verification of spi-calculs specifications”, Politecnico di Torino I.R. DAI/ARC 1-02.
M. Fiore, and M. Abadi, “Computing Symbolic Models for Verifying Cryptographic Protocols”, Proc. of 14th IEEE Computer Security Foundations Workshop, pp. 160–173, June 2001.
A. Huima, “Efficient Infinite-State Analysis of Security Protocols”, Proc. of FLOC Workshop on Formal Methods and Security Protocols, 1999.
G. Lowe, “Breaking and fixing the Needham-Schroeder public-key protocol using FDR”, Proc. of TACAS’97, Springer LNCS 1055, 1996.
D. A. McAllester, “Automatic Recognition of Tractability in Inference Relations”, Journal of the ACM, Vol. 40, No. 2, April 1993, pp. 284–303.
J. Millen, and V. Shmatikov, “Constraint solving for Bounded-Process Cryptographic Protocol Analysis”, 8th ACM Conference on Computer and Communication Security, pages 166–175, November 2001.
R. Milner, J. Parrow, and D. Walker, “A Calculus of mobile processes, parts I and II”, Information and Computation, pages 1–40 and 41-77, September 1992.
L. C. Paulson, “The inductive approach to verifying cryptographic protocols”, Journal of Computer Security, Vol. 6, pp. 85–128, 1998.
D. Prawitz, “Natural Deduction: A Proof-Theoretical Study”, Almqvist & Wiskell, 1965.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cibrario B., I., Durante, L., Sisto, R., Valenzano, A. (2003). A New Knowledge Representation Strategy for Cryptographic Protocol Analysis. In: Garavel, H., Hatcliff, J. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2003. Lecture Notes in Computer Science, vol 2619. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36577-X_21
Download citation
DOI: https://doi.org/10.1007/3-540-36577-X_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00898-9
Online ISBN: 978-3-540-36577-8
eBook Packages: Springer Book Archive