University of Surrey

Test tubes in the lab Research in the ATI Dance Research

Equal To The Task?

Heather, J and Schneider, S (2002) Equal To The Task? In: European Symposium on Research on Computer Security.

[img]
Preview
PDF
fulltext.pdf

Download (223Kb)

Abstract

<p>Many methods of analysing security protocols have been proposed, but most such methods rely on analysing a protocol running only a finite network. Some, however - notably, data independence, the strand spaces model, and the rank functions model - can be used to prove correctness of a protocol running on an unbounded network. <p>Roscoe and Broadfoot in [17] show how data independence techniques may be used to verify a security protocol running on an unbounded network. They also consider a weakness inherent in the RSA algorithm, discovered by Franklin and Reiter [3], and show that their data independence approach cannot deal with an intruder endowed with the ability to exploit this weakness. <p>In this paper, we show that neither can the use of honest ideals in the strand spaces model or the use of rank functions in the CSP model be easily adapted to cover such an intruder. In each case, the inequality tests required to model the new intruder cause problems when attempting to extend analysis of a finite network to cover an unbounded network. The results suggest that more work is needed on adapting the intruder model to allow for cryptographic attacks.</p>

Item Type: Conference or Workshop Item (UNSPECIFIED)
Related URLs:
Divisions: Faculty of Engineering and Physical Sciences > Computing Science
Depositing User: Mr Adam Field
Date Deposited: 27 May 2010 14:45
Last Modified: 23 Sep 2013 18:35
URI: http://epubs.surrey.ac.uk/id/eprint/1876

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