A Formal Approach for Reasoning About a Class of Diffie-Hellman Protocols | Zendy

Rob Delicata | Zendy; Steve Schneider | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A Formal Approach for Reasoning About a Class of Diffie-Hellman Protocols

Author(s) -

Rob Delicata,

Steve Schneider

Publication year - 2006

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-32628-6

DOI - 10.1007/11679219_4

Subject(s) - computer science , secrecy , theoretical computer science , protocol (science) , class (philosophy) , cryptographic protocol , context (archaeology) , diffie–hellman key exchange , formal methods , cryptography , programming language , computer security , public key cryptography , artificial intelligence , key exchange , encryption , medicine , paleontology , alternative medicine , pathology , biology

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research