University of Surrey

Test tubes in the lab Research in the ATI Dance Research

A formal approach for reasoning about a class of Diffle-Hellman protocols

Delicata, R and Schneider, S (2006) A formal approach for reasoning about a class of Diffle-Hellman protocols In: UNSPECIFIED UNSPECIFIED, pp. 34-46.

fulltext.pdf - Accepted version Manuscript
Available under License : See the attached licence file.

Download (75kB)
[img] Text (licence)

Download (1kB)


We present a framework for reasoning about secrecy in a class of Diffie-Hellman protocols. The technique, which shares a conceptual origin with the idea of a rank function, uses the notion of a message-template to determine whether a given value is generable by an intruder in a protocol model. Traditionally, the rich algebraic structure of Diffie-Hellman messages has made it difficult to reason about such protocols using formal, rather than complexity-theoretic, techniques. We describe the approach in the context of the MTI A(0) protocol, and derive the conditions under which this protocol can be considered secure.

Item Type: Book Section
Divisions : Faculty of Engineering and Physical Sciences > Computing Science
Authors :
Delicata, R
Schneider, S
Date : 2006
DOI : 10.1007/11679219_4
Contributors :
ContributionNameEmailORCID, T, F, PYA, S BERLIN,
Depositing User : Mr Adam Field
Date Deposited : 29 Sep 2011 10:44
Last Modified : 31 Oct 2017 14:09

Actions (login required)

View Item View Item


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