Abstract
It is necessary to development the formal tools for verifying cryptographic protocols because of the subtlety of cryptographic protocols flaws; In terms of the notions of restrictive channel and equivalent message, this paper presents a approach that utilizes the substitution rules of messages and deduction rules to prove whether the insecure states of cryptographic protocols are reachable or not, and the analysis of a famous protocol shows the validity of the method.
The original version of this chapter was revised: The copyright line was incorrect. This has been corrected. The Erratum to this chapter is available at DOI: 10.1007/978-0-387-35515-3_53
Chapter PDF
Similar content being viewed by others
References
MILLEN J.K.; CLARK S.C.; FREEDMAN S.B.; 1987; IEEE Transactions on Software Engineering; “The Interrogator: Protocol Security Analysis”; Vol. 13 no. 2.
KEMMERER R.; MEADOWS C.; MILLEN J.; 1994; Journal of Cryptology; “Three Systems for Cryptographic Protocol Analysis”; Vol. 7 no. 2.
MEADOWS C.; 1996; Journal of Logic Programming; “The NRL Protocol Analyzer: an Overview”; Vol. 26 no. 2.
LOWE 97] LOWE G.; ROSCOE B.; 1997; IEEE Transactions on Software Engineering; “Using CSP to Detect Errors in the TMN Protocol”; Vol. 23 no. 10.
MITC 97] MITCHELL J.C.; MITCHELL M.; STERN U.; 1997; IEEE Symposium on Security and Privacy; “Automated Analysis of Cryptographic Protocols Using Murcp”.
LOWE G.; 1998; “Towards a Completeness Result for ModelChecking of Security Protocols”; http: //www.mcs.le.ac.uk/—glowe/security/papers/completeness. ps.gz.
BURROWS M.; ABADI M.; NEEDHAM R.; 1990; ACM Transaction on Computer Systems; “A Logic of Authentication”; Vol. 8, no. 1.
GONG L.; NEEDHAM R.; YAHALOM R.; 1990; In Proceedings of the 1990 IEEE Computer Society Symposium on Research in Security and Privacy; “Reasoning about Belief in Cryptographic Protocols”.
ABADI M.; TUTTLE M.; 1991; In Proceedings of the 10th ACM Symposium on Principles of Distributed Computing; “A Semantics for a Logic of Authentication”.
SYVERSON P.; ORSCHOT P.C.V.; 1994; In Proceedings of 1994 IEEE Symposium on Security and Privacy; “On Unifying some Cryptographic Protocol Logics”.
ORSCHOT P.C.V.; 1993; In Proceedings of the First ACM Conference on Computer and Communications Security; “Extending Cryptographic Logics of Belief to Key Agreement Protocols”.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 IFIP International Federation for Information Processing
About this paper
Cite this paper
Sun, Y., Wang, X. (2000). A Simple and Efficient Approach to Verifying Cryptographic Protocols. In: Qing, S., Eloff, J.H.P. (eds) Information Security for Global Information Infrastructures. SEC 2000. IFIP — The International Federation for Information Processing, vol 47. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35515-3_20
Download citation
DOI: https://doi.org/10.1007/978-0-387-35515-3_20
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-5479-7
Online ISBN: 978-0-387-35515-3
eBook Packages: Springer Book Archive