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, 34 - 46.
|PDF - Accepted Version |
Available under License : See the attached licence file.
|Plain Text (licence)|
Official URL: http://dx.doi.org/10.1007/11679219_4
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|
|Deposited By:||Mr Adam Field|
|Deposited On:||29 Sep 2011 11:44|
|Last Modified:||16 Feb 2013 15:37|
Repository Staff Only: item control page