Journal of Networks, Vol 6, No 10 (2011), 1422-1429, Oct 2011
doi:10.4304/jnw.6.10.1422-1429

A Scalable ID-based Constant-round AGKE Protocol with Logarithmic Computation Complexity

Xiufeng Zhao, Qiuliang Xu, Hao Wang, Peng He

Abstract


Group key establishment is one of the basic building blocks in securing group communication. In this paper, motivated by Desmedt's BD-II protocol, we propose a secure ID-Based group key establishment protocol which has a constant number of rounds and requires only  computation and communication. Our scheme achieves key negotiate by scalar multiplication other than using pairing computation which requires expensive computation cost. Moreover, we have adapted aggregate signature technique verifying the validity of transcripts simultaneously, which greatly improves the computational efficiency. We have proved the security of protocol under the intractability of DDH problem in the RO model.


Keywords


group key establishment, identity-based; tree structure; aggregate signature

References


W. Diffie and M. Hellman, New directions in cryptography, IEEE Trans. Information Theory, vol. 22, no. 6, pp. 644–654, 1976.
http://dx.doi.org/10.1109/TIT.1976.1055638

M. Burmester and Y. Desmedt. A secure and efficient conference key distribution system. In Proc. Eurocrypt ’94, LNCS vol. 950, Berlin: Springer-Verlag, pp. 275–286, 1995.

Y. Kim, A. Perrig, and G. Tsudik, Tree based group key establishment. ACM Trans. Information System Security, vol. 7, no. 1, pp. 60–96, 2004.
http://dx.doi.org/10.1145/984334.984337

Y. Kim, A. Perrig, and G. Tsudik, Simple and fault-tolerant key establishment for dynamic collaborative groups. In Proc. ACM CCS 2000, New York: ACM press, pp. 235–244, 2000.

Y. Kim, A. Perrig, and G. Tsudik, Communication-efficient group key establishment. In Proc. 17th Int. Inf. Security Conf., IFIP Section MMI, pp. 229–244, 2001.

S. Lee, Y. Kim, K. Kim, and D.-H. Ryu. An efficient tree-based group key establishment using bilinear map. In Proc. Applied Cryptography and Network Security (ACNS ’03), LNCS vol. 2846, Berlin: Springer-Verlag, pp. 357–371, 2003.

R. Barua, R. Dutta, P. Sarkar. Extending Joux Protocol to Multi Party Key Establishment. In Proc. Indocrypt2003, LNCS vol.2903/2003, Berlin: Springer-Verlag, pp.33–60, 2004.

A. Joux, A one round protocol for tripartite Diffie-Hellman. In Proc. Algorithm Number Theory 2000, LNCS vol. 1838, Berlin: Springer-Verlag, pp. 385–394, 2000.
http://dx.doi.org/10.1007/10722028_23

R. Dutta, R. Barua, and P. Sarkar, Provably secure authenticated tree based group key establishment. In Proc. ICICS 2004, LNCS vol. 3269, Berlin: Springer-Verlag, pp. 92–104, 2004.

R. Dutta and R. Barua, Dynamic group key establishment in tree-based setting. In Proc. ACISP 2005, LNCS vol. 3574, Berlin: Springer-Verlag, pp. 101–112, 2005.

M. Burmester and Y. Desmedt, Efficient and secure conference key distribution. In Proc. Int. Workshop on Security Protocols, LNCS vol. 1189, Berlin: Springer-Verlag, pp. 119–130, 1997.

Y. Desmedt, T. Lange, and M. Burmester, Scalable authenticated tree based group key exchange for ad-hoc groups. In Proc. Financial Cryptography and Data Security 2007, LNCS Vol. 4886, Berlin: Springer-Verlag, pp. 104–118, 2007.
http://dx.doi.org/10.1007/978-3-540-77366-5_12

J. Nam, J. Paik, U.-M. Kim, and D. Won, Constant-round authenticated group key exchange with logarithmic computation complexity. In Proc. ACNS 2007, LNCS vol. 4521, Berlin: Springer-Verlag, pp. 158–176, 2007.

A. Shamir. Identity-Based Cryptosystems and Signature Schemes. In Proc. Crypto’84. New York: Springer-Verlag, pp. 47 - 53 1985.

D. Boneh and M. Franklin. Identity-Based Encryption from the Weil Pairing. In Proc. Crypto 2001, LNCS 2139, London: Springer-Verlag, pp. 213-229, 2001.

C. Cocks. An identity based encryption scheme based on quadratic residues. In Proc. the 8th IMA International Conference on Cryptography and Coding, LNCS 2260, Berlin: Springer-Verlag, pp. 26-28, 2001.

K.C. Reddy and D. Nalla, Identity based authenticated group key agreement protocol. In Proc. Indocrypt2002, LNCS Vol. 2551, Berlin: Springer-Verlag, pp. 215-233, 2002.

K. Y. Choi, J. Y. Hwang, and D. H. Lee, Efficient id-based group key establishment with bilinear maps. In Proc. PKC 2004, LNCS Vol. 2947, Berlin: Springer-Verlag, pp. 130–144, 2004.

F.G. Zhang and X.F. Chen, Attack on an ID-based authenticated group key establishment scheme from PKC 2004. Information Processing Letters, Vol. 91 No. 4, pp. 191-193, 2004.
http://dx.doi.org/10.1016/j.ipl.2004.04.008

C.J. CAO, J.F. MA. Identity-based Constant Round Group Key Exchange Protocol via Secret-Share. WSEAS TRANSACTIONS on SYSTEMS. Vol. 7, Issue 1, pp. 7-16, 2008.

M. Bellare and P. Rogaway. Entity Authentication and Key Distribution. In Proc. CRYPTO'93, LNCS vol. 773, Berlin: Springer-Verlag, pp.232-249, 1993.

E. Bresson, O. Chevassut, D. Pointcheval, and J.J. Quisquater. Provably Authenticated Group Diffie-Hellman Key Exchange. In Proc. of the 8th ACM conference on Computer and Communications Secu-rity (CCS'01), New York: ACM Press, pp. 255-264. 2001.

E. Bresson, O. Chevassut and D. Pointcheval, Provably Authenticated Group Diffie-Hellman Key Exchange-The Dynamic Case. In Proc. of Asiacrypt ’02, LNCS Vol. 2248, pp.290-309, London: Springer-Verlag, 2001.

D. Boneh, C. Gentry, B. Lynn, et al., Aggregate and verifiably encrypted signatures from bilinear maps. In Proc. of Eurocrypt'03, LNCS Vol. 2656, Berlin: Springer-Verlag, pp. 416-432, 2003.

F. Hess. Efficient Identity Based Signature Scheme Based on Pairings. In Selected Areas in Cryptography the 9th Annual Int'l Workshop, SAC'02. LNCS vol. 2595. Berlin: Springer-Verlag, pp. 310-324, 2003.


Full Text: PDF


Journal of Networks (JNW, ISSN 1796-2056)

Copyright @ 2006-2012 by ACADEMY PUBLISHER – All rights reserved.