Abstract

It is often a challenging task to make a system satisfy desirable security properties and maintain a low computational overhead. In this paper, we attempt to minimize the gap for two identity-based key agreement protocols, in the sense that we allow our key agreement protocols to satisfy all general desirable security properties including master-key forward security and in the meanwhile achieve a good computational efficiency. Our protocols are novel, since we are able to make use of several nice algebraic properties of the Weil Pairing to outperform other state-of-the-art key agreement protocols. To our knowledge, our second protocol is the first identity-based protocol that provides master key forward security and satisfies all basic desirable security properties based on the key extraction algorithm due to Sakai and Kasahara.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call