Computationally Sound Verification of Security Protocols Using Diffie-Hellman Exponentiation

Recently, it has been proved that computational security can be automatically verified using the Dolev-Yao abstraction. We extend these results by adding a widely used component for cryptographic protocols: Di#e-Hellman exponentiation. Thus our main result is: if the Decisional Di#e-Hellman assumption is verified and the cryptographic primitives used to implement the protocol are secure, then safety in the symbolic world implies safety in the computational world. Therefore, it is possible to prove automatically safety in the computational world