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
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|
|Depositing User:||Mr Adam Field|
|Date Deposited:||27 May 2010 14:46|
|Last Modified:||23 Sep 2013 18:35|
Actions (login required)
Downloads per month over past year