An Efficient Bilinear Pairing-Free Certificateless Two-Party Authenticated Key Agreement Protocol in the eCK Model
This work addresses computational bottlenecks in secure key agreement for systems like IoT or mobile networks, though it is incremental as it builds on existing bilinear pairing-free approaches.
The paper tackled the computational inefficiency in bilinear pairing-free certificateless authenticated key agreement protocols by proposing a new two-party protocol that reduces scalar multiplications over elliptic curve groups, achieving improved efficiency compared to related work.
Recent study on certificateless authenticated key agreement focuses on bilinear pairing-free certificateless authenticated key agreement protocol. Yet it has got limitations in the aspect of computational amount. So it is important to reduce the number of the scalar multiplication over elliptic curve group in bilinear pairing-free protocols. This paper proposed a new bilinear pairing-free certificateless two-party authenticated key agreement protocol, providing more efficiency among related work and proof under the random oracle model.