Using ProVerif to Analyze Protocols With Diffie-Hellman Exponentiation

Free registration required

Executive Summary

ProVerif is one of the most successful tools for cryptographic protocol analysis. However, dealing with algebraic properties of operators such as the eXclusive OR (XOR) and Diffie-Hellman exponentiation has been problematic. Recently, the authors have developed an approach which enables ProVerif, and related tools, to analyze a large class of protocols that employ the XOR operator. In this paper, they adapt this approach to the case of Diffie-Hellman exponentiation. The core of their approach is to reduce the derivation problem for Horn theories modulo algebraic properties of Diffie-Hellman exponentiation to a purely syntactical derivation problem for Horn theories.

  • Format: PDF
  • Size: 199.6 KB