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.

Preview	Text fulltext.pdf - Accepted version Manuscript Available under License : See the attached licence file. Download (75kB)
	Text (licence) licence.txt Download (1kB)

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 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 :	Name Email ORCID Delicata, R Schneider, S
Date :	2006
DOI :	10.1007/11679219_4
Contributors :	Contribution Name Email ORCID http://www.loc.gov/loc.terms/relators/EDT Dimitrakos, T http://www.loc.gov/loc.terms/relators/EDT Martinelli, F http://www.loc.gov/loc.terms/relators/EDT Ryan, PYA http://www.loc.gov/loc.terms/relators/EDT Schneider, S http://www.loc.gov/loc.terms/relators/PBL SPRINGER-VERLAG BERLIN,
Depositing User :	Mr Adam Field
Date Deposited :	29 Sep 2011 10:44
Last Modified :	31 Oct 2017 14:09
URI:	http://epubs.surrey.ac.uk/id/eprint/7182

Actions (login required)

View Item

Downloads