An efficient certificateless authenticated key agreement protocol without bilinear pairings

TL;DR

This paper introduces a new certificateless authenticated key agreement protocol that eliminates the need for bilinear pairings, reducing computational costs and maintaining security in the random oracle model.

Contribution

A novel pairing-free certificateless key agreement protocol that requires only five scalar multiplications, improving efficiency over existing pairing-based methods.

Findings

Requires only five scalar multiplications for key agreement

Eliminates the computationally expensive bilinear pairings

Proven secure in the random oracle model

Abstract

Certificateless public key cryptography simplifies the complex certificate management in the traditional public key cryptography and resolves the key escrow problem in identity-based cryptography. Many certificateless authenticated key agreement protocols using bilinear pairings have been proposed. But the relative computation cost of the pairing is approximately twenty times higher than that of the scalar multiplication over elliptic curve group. Recently, several certificateless authenticated key agreement protocols without pairings were proposed to improve the performance. In this paper, we propose a new certificateless authenticated key agreement protocol without pairing. The user in our just needs to compute five scale multiplication to finish the key agreement. We also show the proposed protocol is secure in the random oracle model.