CryptoDB
An Efficient Authenticated Key Exchange Protocol with a Tight Security Reduction
Authors: | |
---|---|
Download: | |
Abstract: | In this paper, we present a new authenticated key exchange(AKE) protocol, called NETS, and prove its security in the extended Canetti-Krawczyk model under the random oracle assumption and the gap Diffie-Hellman(GDH) assumption. Our protocol enjoys a simple and tight security reduction compared to those of HMQV and CMQV without using the Forking Lemma. Each session of the NETS protocol requires only three exponentiations per party, which is comparable to the efficiency of MQV, HMQV and CMQV. |
BibTeX
@misc{eprint-2008-18022, title={An Efficient Authenticated Key Exchange Protocol with a Tight Security Reduction}, booktitle={IACR Eprint archive}, keywords={cryptographic protocols / authenticated key exchange, gap Diffie-Hellman assumption}, url={http://eprint.iacr.org/2008/345}, note={ jlee05@ensec.re.kr 14097 received 5 Aug 2008}, author={Jooyoung Lee and Choon Sik Park}, year=2008 }