Beyond the Finite Variant Property: Extending Symbolic Diffie-Hellman Group Models (Extended Version)
Preprint
Abstract
Diffie-Hellman groups are commonly used in cryptographic protocols. While most state-of-the-art, symbolic protocol verifiers support them to some degree, they do not support all mathematical operations possible in these groups. In particular, they lack support for exponent addition, as these tools reason about terms using unification, which is undecidable in the theory describing all Diffie-Hellman operators. In this paper we approximate such a theory and propose a semi-decision procedure to determine whether a protocol, which may use all operations in such groups, satisfies user-defined properties. We implement this approach by extending the Tamarin prover to support the full Diffie-Hellman theory, including group element multiplication and hence addition of exponents. This is the first time a state-of-the-art tool can model and reason about such protocols. We illustrate our approach's effectiveness with different case studies: ElGamal encryption and MQV. Using Tamarin, we prove security properties of ElGamal, and we rediscover known attacks on MQV.Keywords
All Related Versions
This publication has 6 references indexed in Scilit:
- An Algebra for Symbolic Diffie-Hellman Protocol AnalysisLecture Notes in Computer Science, 2013
- AProVE 1.2: Automatic Termination Proofs in the Dependency Pair Framework2006
- ENUMERABLE SETS ARE DIOPHANTINE2003
- An unknown key-share attack on the MQV key agreement protocolACM Transactions on Information and System Security, 2001
- Unification in the Union of Disjoint Equational Theories: Combining Decision ProceduresJournal of Symbolic Computation, 1996
- Formal analysis of key exchange protocols and physical protocols