University of Surrey

Test tubes in the lab Research in the ATI Dance Research

Towards Automatic Verification of Authentication Protocols on an Unbounded Network.

Heather, J and Schneider, S (2000) Towards Automatic Verification of Authentication Protocols on an Unbounded Network. CSFW'00. 132 - 143.

[img]
Preview
PDF
fulltext.pdf

Download (331Kb)

Abstract

Schneider's (1998) work on rank functions provides a formal approach to verification of certain properties of a security protocol. However, he illustrates the approach only with a protocol running on a small network; and no help is given with the somewhat hit-and-miss process of finding the rank function which underpins the central theorem.

In this paper, we develop the theory to allow for an arbitrarily large network, and give a clearly defined decision procedure by which one may either construct a rank function, proving correctness of the protocol, or show that no rank function exists.

We discuss the implications of the absence of a rank function, and the open question of completeness of the rank function theorem.

Item Type: Article
Related URLs:
Divisions: Faculty of Engineering and Physical Sciences > Computing Science
Depositing User: Mr Adam Field
Date Deposited: 27 May 2010 14:46
Last Modified: 23 Sep 2013 18:35
URI: http://epubs.surrey.ac.uk/id/eprint/1934

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year


Information about this web site

© The University of Surrey, Guildford, Surrey, GU2 7XH, United Kingdom.
+44 (0)1483 300800