Diffie-Hellman without Difficulty

Publication: Research - peer-reviewArticle in proceedings – Annual report year: 2011

View graph of relations

An excellent way for a protocol to obtain shared keys is Diffie-Hellman. For the automated verification of security protocols, the use of Diffie-Hellman poses a certain amount of difficulty, because it requires algebraic reasoning. Several tools work in the free algebra and even for tools that do support Diffie-Hellman, the algebraic reasoning becomes a bottleneck. We provide a new relative-soundness result: for a large class of protocols, significantly restricting the abilities of the intruder is without loss of attacks. We also show the soundness of a very restrictive encoding of Diffie-Hellman proposed by Millen and how to obtain a problem that can be answered in the free algebra without increasing its size upon encoding. This enables the efficient use of free-algebra verification tools for Diffie-Hellman based protocols and significantly reduces search-spaces for tools that do support algebraic reasoning.
Original languageEnglish
Title of host publicationFormal Aspects of Security and Trust : 8th International Workshop, FAST 2011
EditorsGilles Barthe, Anupam Datta, Sandro Etalle
PublisherSpringer
Publication date2011
Pages214-229
DOIs
StatePublished

Conference

ConferenceFormal Aspects of Security and Trust
Number8
CountryBelgium
CityLeuven
Period12/09/1114/09/11
NameLecture Notes in Computer Science
ISSN (Print)0302-9743
CitationsWeb of Science® Times Cited: No match on DOI
Download as:
Download as PDF
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
PDF
Download as HTML
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
HTML
Download as Word
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
Word

ID: 6312706