Strongly Secure Authenticated Key Exchange Protocol Based on Computational Diffie-Hellman Problem

Hai Huang; Zhenfu Cao

Paper 2008/500

Strongly Secure Authenticated Key Exchange Protocol Based on Computational Diffie-Hellman Problem

Hai Huang and Zhenfu Cao

Abstract

Currently, there are a lot of authenticated key exchange (AKE) protocols in literature. However, the security proofs of this kind of protocols have been established to be a non-trivial task. The main issue is that without static private key it is difficult for simulator to fully support the SessionKeyReveal and EphemeralKeyReveal queries. Some proposals which have been proven secure either just hold in relatively weak models which do not fully support above-mentioned two queries or make use of the stronger gap assumption. In this paper, using a new technique named twin Diffie-Hellman problem proposed by Cash, Kiltz and Shoup, we present a new AKE protocol based on the computational Diffie-Hellman (CDH) assumption, which is more standard than gap Diffie-Hellman (GDH) assumption. Moreover, our scheme is shown to be secure in strong security definition, the enhanced Canetti-Krawczyk (eCK) model introduced by LaMacchia, Lauter and Mityagin, which better supports the adversaries' queries than previous models.

Metadata

Available format(s): PDF
Category: Cryptographic protocols
Publication info: Published elsewhere. accepted as short paper for Inscrypt 2008
Keywords: Authenticated key exchange CDH problem Twin DH problem Trapdoor test Provably secure
Contact author(s): chinesechess @ sjtu edu cn
History: 2008-12-02: received
Short URL: https://ia.cr/2008/500
License: CC BY

BibTeX

@misc{cryptoeprint:2008/500,
      author = {Hai Huang and Zhenfu Cao},
      title = {Strongly Secure Authenticated Key Exchange Protocol Based on Computational Diffie-Hellman Problem},
      howpublished = {Cryptology {ePrint} Archive, Paper 2008/500},
      year = {2008},
      url = {https://eprint.iacr.org/2008/500}
}