An algebraic approach to the verification of a class of Diffie-Hellman protocols |
| |
Authors: | Rob Delicata Steve Schneider |
| |
Affiliation: | 1. Department of Computing, University of Surrey, Guildford, Surrey, GU2 7XH, UK
|
| |
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 protocols, and derive conditions under which each protocol in the suite can be considered secure. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|