Verifying authentication protocol implementations

Schneider, Steve A (2002) Verifying authentication protocol implementations

Preview

Text fulltext.pdf Download (242kB)

Abstract

Formal methods for verifying authentication protocols tend to assume an idealised, perfect form of encryption. This approach has been spectacularly successful in finding flaws, but when we aim for proofs of correctness then we need to consider this assumption more carefully, and perhaps to weaken it to reflect properties of real cryptographic mechanisms. This paper reviews the existing CSP approach to verifying protocols, and considers how algebraic properties of real cryptographic mechanisms can be incorporated within a rank function verification. The approach is illustrated with an authentication protocol which makes use of exclusive-or.

Item Type:	Conference or Workshop Item (UNSPECIFIED)
Divisions :	Faculty of Engineering and Physical Sciences > Computer Science
Authors :	Name Email ORCID Schneider, Steve A s.schneider@surrey.ac.uk
Date :	20 March 2002
Additional Information :	This is the author's version of the paper presented at FMoods 2002. http://trese.cs.utwente.nl/fmoods2002/intro.html
Depositing User :	Mr Adam Field
Date Deposited :	27 May 2010 14:46
Last Modified :	06 Jul 2019 05:07
URI:	http://surrey.eprints-hosting.org/id/eprint/1930

Available Versions of this Item

• Verifying authentication protocol implementations (deposited 27 May 2010 14:46) [Currently Displayed]
  • Verifying authentication protocol implementations (deposited 05 Sep 2017 11:09)

Actions (login required)

View Item

Downloads