Strongly secure certificateless one-pass authenticated key agreement scheme
Keywords:
Authenticated key agreement, certificateless cryptography, eCK model, one-pass, provable security.Abstract
As certificateless public key cryptography (CLPKC) could solve the problem of keyescrow, recently it has been studied more and more. Certificateless authenticated keyagreement (CLAKA), as an important part of the CLPKC, also attracts considerableattention. So far, many kinds of provably secure one-pass CLAKA schemes have beenproposed. However, only few of them are given security proof in a formal model.In this paper, we propose a novel one-pass CLAKA scheme and demonstrate that itis provably secure under the gap bilinear computational Diffie-Hellman (GBCDH)assumption and the Gap Computational Diffie-Hellman (GCDH) assumption in theextended Canetti-Krawczyk (eCK) model. And as far as we know, our scheme is thefirst provably secure CLAKA scheme in the eCK model.References
Al-Riyami, S. & Paterson, K.G. 2003. Certificateless public key cryptography,
Proceedings of ASIACRYPT 2003, Taipei, Taiwan.
Barreto, P., Kim, H., Lynn, B. & Scott, M. 2002. Efficient algorithms for pairingbased
cryptosystems. Advances in Cryptology – Crypto 2002. California, USA.
Bellare, M. & Rogaway, P. 1993. Entity authentication and key distribution. In:
Proceedings of the CRYPTO 1993. California, USA.
Bellare, M. & Rogaway, P. 1995. Provably secure session key distribution: the
three party case. Proceedings of the 27th ACM symposium on the theory of
computing. Massachusetts, USA.
Boneh, D. & Franklin, M. 2003. Identity-based encryption from the Weil pairing.
SIAM Journal on Computing 32:586–615.
Canetti, R. & Krawczyk, H. 2001. nalysis of key-exchange protocols and their use
for building secure channels. Proceedings of the EUROCRYPT 2001. Innsbruck,
Austria.
Chen, W., Zhang, L. & Qin B. 2009. Certificateless One-Way Authenticated Two-
Party Key Agreement Protocol , Fifth International Conference on Information
Assurance and Security, Xian China.
Choo, K., Boyd, C. & Hitchcock Y. 2005. Examining indistinguishability-based
proof models for key establishment protocols. Proceedings of the ASIACRYPT
Chennai, India.
Galbraith, S., Harrison, K. & Soldera, D. 2002. Implementing the Tate pairing,
Proceedings of the 5th International Symposium on Algorithmic Number Theory
– ANTS, Sydney, Australia.
He, D., Chen, Y., Chen, J. & Zhang, R. 2011. A new two-round certificateless
authenticated key agreement protocol without bilinear pairings. Mathematical
and Computer Modelling 54: 3143–3152.
He, D., Padhye, S. & Chen, J. 2012. An efficient certificateless two-party authenticated
key agreement protocol. Computers & Mathematics with Applications 64(6):
–1926.
Huang, H. & Cao, Z. 2011. IDOAKE: strongly secure ID-based one-pass
authenticated key exchange protocol. Security and Communication Networks
(10): 1153–1161.
Strongly secure certificateless one-pass authenticated key agreement scheme 17
LaMacchia, B., Lauter, K. & Mityagin, A. 2007. Stronger security of authenticated
key exchange. Proceedings of the ProvSection 2007. Alberta, CANADA.
Lippold, G., Boyd, C. & Nieto, J. 2009. Strongly secure certificateless key agreement.
Pairing 2009, 206-230.
Shamir, A. 1984. Identity-based cryptosystems and signature protocols. Proc.
CRYPTO1984. California, USA.
