University of Surrey

Test tubes in the lab Research in the ATI Dance Research

An algebraic approach to the verification of a class of Diffie-Hellman protocols

Delicata, R and Schneider, S (2007) An algebraic approach to the verification of a class of Diffie-Hellman protocols INT J INF SECUR, 6 (2-3). 183 - 196. ISSN 1615-5262

[img]
Preview
PDF
ijis07.pdf
Available under License : See the attached licence file.

Download (123Kb)
[img] Plain Text (licence)
licence.txt

Download (1516b)

Abstract

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 complexitytheoretic, techniques. We describe the approach in the context of the MTI protocols, and derive conditions under which each protocol in the suite can be considered secure.

Item Type: Article
Uncontrolled Keywords: protocol verification, Diffie-Hellman
Divisions: Faculty of Engineering and Physical Sciences > Computing Science
Depositing User: Symplectic Elements
Date Deposited: 02 Nov 2011 11:20
Last Modified: 23 Sep 2013 18:45
URI: http://epubs.surrey.ac.uk/id/eprint/7236

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