Papers
Topics
Authors
Recent
Search
2000 character limit reached

An Efficient Bilinear Pairing-Free Certificateless Two-Party Authenticated Key Agreement Protocol in the eCK Model

Published 1 Apr 2013 in cs.CR, cs.IT, and math.IT | (1304.0383v4)

Abstract: 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.

Citations (15)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.