Using ProVerif to Analyze Protocols with Diffie-Hellman Exponentiation

Comparison of Cryptographic Verification Tools Dealing with Algebraic Properties

“…This attack is similar to the attack on the Diffie-Hellman protocol. For DH-ProVerif this protocol was already studied by Kuesters et al in [25]. As it is mentioned in [25] a naive modelling of this protocol produces an input file for ProVerif, which does not terminate.…”

“…For DH-ProVerif this protocol was already studied by Kuesters et al in [25]. As it is mentioned in [25] a naive modelling of this protocol produces an input file for ProVerif, which does not terminate. The situation is similar as the situation we found in the Salary Sum with Exclusive-Or.…”

“…Recently R. Küster and T. Truderung proposed two new "tools" XORProVerif [27] and DH-ProVerif [25]. These small programs transform a protocol using Exclusive-Or and Diffie-Hellman mechanism into a protocol in Horn clauses compatible with ProVerif.…”

“…On the other hand ProVerif can verify cryptographic protocols for an unbounded number of session, but is not able to deal with such properties. But, recently Kuesters et al proposed in [25,26] two methods for transforming a protocol description using Exclusive-Or and Diffie-Hellman property into a ProVerif input file. Hence we use these two "translators" in order to compare the following three tools: CL-Atse, OFMC and ProVerif.…”

“…All these examples are evidences that relaxing the perfect encryption hypothesis by considering equational theories is an important issue in security. In order to achieve this goal some tools have been developed for considering some algebraic properties [7,8,20,25,26,44].…”