An Efficient Authenticated Key Exchange Protocol With a Tight Security Reduction

Download Now Free registration required

Executive Summary

This paper presents a new Authenticated Key Exchange (AKE) protocol, called NETS, and proves its security in the extended Canetti-Krawczyk model under the random oracle assumption and the Gap Diffie-Hellman (GDH) assumption. The 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.

  • Format: PDF
  • Size: 213.6 KB