Soundness of Symbolic Equivalence for Modular Exponentiation - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2006

Soundness of Symbolic Equivalence for Modular Exponentiation


In this paper, we study the Dynamic Decisional Diffie-Hellman (3DH) problem, a powerful generalization of the Decisional Diffie-Hellman (DDH) problem. Our main result is that DDH implies 3DH. This result leads to significantly simpler proofs for protocols by relying directly on the more general problem. Our second contribution is a computationally sound symbolic technique for reasoning about protocols that use symmetric encryption and modular exponentiation. We show how to apply our results in the case of the Burmester & Desmedt protocol.
Fichier principal
Vignette du fichier
paper4.pdf (104.06 Ko) Télécharger le fichier

Dates and versions

inria-00080673 , version 1 (20-06-2006)


  • HAL Id : inria-00080673 , version 1


Yassine Lakhnech, Laurent Mazare, Bogdan Warinschi. Soundness of Symbolic Equivalence for Modular Exponentiation. Workshop on Formal and Computational Cryptography - FCC 2006, Véronique Cortier et Steve Kremer, Jul 2006, Venice/Italy. ⟨inria-00080673⟩
195 View
112 Download


Gmail Facebook Twitter LinkedIn More