| HAL-Inria | Publications, software ... of Inria's scientists |
Conference papers
Soundness of Symbolic Equivalence for Modular Exponentiation
Abstract : 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.
Cited literature [14 references]
https://hal.inria.fr/inria-00080673
Contributor : Véronique Cortier Connect in order to contact the contributor
Submitted on : Tuesday, June 20, 2006 - 3:03:19 PM
Last modification on : Friday, January 21, 2022 - 3:09:06 AM
Long-term archiving on: : Monday, April 5, 2010 - 11:06:34 PM
Contributor : Véronique Cortier Connect in order to contact the contributor
Submitted on : Tuesday, June 20, 2006 - 3:03:19 PM
Last modification on : Friday, January 21, 2022 - 3:09:06 AM
Long-term archiving on: : Monday, April 5, 2010 - 11:06:34 PM