A decision procedure for the existence of a rank function.
Heather, J and Schneider, S (2005) A decision procedure for the existence of a rank function. Journal of Computer Security, 13 (2). 317 - 344. ISSN 0926-227X
Available under License : See the attached licence file.
|Plain Text (licence)|
Official URL: http://iospress.metapress.com/content/va78em9k994n...
Schneider's work on rank functions [IEEE TSE 24(9) (1998)] 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 that 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 briefly discuss the implications of the absence of a rank function, and the open question of completeness of the rank function theorem
|Divisions:||Faculty of Engineering and Physical Sciences > Computing Science|
|Deposited By:||Symplectic Elements|
|Deposited On:||20 Oct 2011 09:56|
|Last Modified:||16 Feb 2013 16:10|
Repository Staff Only: item control page