DOI QR코드

DOI QR Code

An Efficient Group Key Agreement Using Hierarchical Key Tree in Mobile Environment

  • Cho, Seokhyang (Dept. of Information and Communication, Pyeongtaek University)
  • Received : 2018.01.15
  • Accepted : 2018.02.14
  • Published : 2018.02.28

Abstract

In this paper, the author proposes an efficient group key agreement scheme in a mobile environment where group members frequently join and leave. This protocol consists of basic protocols and general ones and is expected to be suitable for communications between a mobile device with limited computing capability and a key distributing center (or base station) with sufficient computing capability. Compared with other schemes, the performance of the proposed protocol is a bit more efficient in the aspects of the overall cost for both communication and computation where the computational efficiency of the scheme is achieved by using exclusive or operations and a one-way hash function. Also, in the aspect of security, it guarantees both forward and backward secrecy based on the computational Diffie-Hellman (CDH) assumption so that secure group communication can be made possible. Furthermore, the author proves its security against a passive adversary in the random oracle model.

Keywords

References

  1. B. Bhargava, M. Annamalai, and E. Pitoura, "Digital Library Services in Mobile Computing", ACM SIGMOD Record, Vol. 24, No. 4, pp. 34-39, Dec. 1995. https://doi.org/10.1145/219713.219746
  2. Y. Huang and H. Garcia-Molina, "Publish/Subscribe in a Mobile Environment", Proc. of the 2nd ACM International Workshop on Data Engineering for Wireless and Mobile Access(MobiDE 2001), pp. 27-34, 2001.
  3. T. Phan, L. Huang, and C. Dulan, "Challenge: Integrating Mobile Wireless Devices into the Computational Grid", Proc. of the 8th ACM Conference on Mobile Computing and Networking(MOBICOM 2002), pp. 271-278, Sep. 2002.
  4. Sung-Hwa Lim and Jai-Hoon Kim, "Real-time Broadcast Algorithm for Mobile Computing", The Journal of Systems and Software, Vol. 69, No. 2, pp. 173-181, Jan. 2004. https://doi.org/10.1016/S0164-1212(03)00083-9
  5. W. Diffie and M. E. Hellman, "New Directions in Cryptography", IEEE Transactions on Information Theory, Vol. IT-22, No. 6, pp. 644-654, Nov. 1976.
  6. Yongdae Kim, Adrian Perrig, and Gene Tsudik, "Group Key Agreement Efficient in Communication", IEEE Transactions on Computers, Vol. 53, No. 7, pp. 905-921, Jul. 2004. https://doi.org/10.1109/TC.2004.31
  7. Sangwon Lee, Yongdae Kim, Kwangjo Kim, and Dae-Hyun Ryu, "An Efficient Tree-Based Group Key Agreement Using Bilinear Map", ACNS 2003, LNCS 2846, pp. 357-371, 2003.
  8. Sandro Rafaeli, Laurent Marthy, and David Hutchison, "EHBT: An Efficient Protocol for Group Key Management", NGC(Networked Group Communication) 2001, LNCS 2233, pp. 159-171, Oct. 2001.
  9. Lijun Liao and Mark Manulis, "Tree-based group key agreement framework for mobile ad-hoc networks", Elsevier, Future Generation Computer Systems, Vol. 23, No. 6, pp. 787-803, July 2007. https://doi.org/10.1016/j.future.2007.01.001
  10. Sang-won Lee, Jung Hee Cheon, and Yongdae Kim, "Tree-based Group Key Agreement Protocol using Pairing", Journal of The Korea Institute of Information Security and Cryptology, Vol. 13, No. 3, pp. 101-110, Jun. 2003.
  11. Abhimanyu Kumar and Sachin Tripathi, "Ternary Tree Based Group Key Agreement Protocol Over Elliptic Curve for Dynamic Group", International Journal of Computer Applications(0975-888), Vol. 86, No. 7, pp. 17-25, Jan. 2014. https://doi.org/10.5120/14997-3072
  12. Yvo Desmedt, Tanja Lange, and Mike Burmester, "Scalable Authenticated Tree Based Group Key Exchange for Ad-Hoc Groups", FC 2007 and USEC 2007, LNCS 4886, pp. 104-118, 2007.
  13. Junghyun Nam, Juryon Paik, Youngsook Lee, Jin Kwak, Ung Mo Kim, and Dongho Won, "Infringing Key Authentication of an ID-Based Group Key Exchange Protocol Using Binary Key Trees", KES 2007/WIRN 2007, Part I, LNAI 4692, pp. 672-679, 2007.
  14. Minghui Zheng, Guohua Cui, Muxiang Yang, and Jun Li, "Scalable Group Key Management Protocol Based on Key Material Transmitting Tree", ISPEC 2007, LNCS 4464, pp. 301-313, 2007.
  15. K. Becker and U. Wille, "Communication Complexity of Group Key Distribution", Proc. of the 5th ACM Conference on Computer and Communication Security(CCS 1998), pp. 1-6, 1998.
  16. P.S.L.M. Barreto, H.Y. Kim, B. Linn, and M. Scott, "Efficient Algorithms for Pairing-Based Cryptosystems", Advances in Cryptology-Crypto 2002, LNCS 2442, pp. 354-368, Aug. 2002.
  17. Alfred J. Menezes, Paul C. van Oorschot, and Scott A. Vanstone, "Handbook of Applied Cryptography", CRC Press, p. 113, 1997.
  18. M. Bellare and P. Rogaway, "Random Oracles are Practical: A Paradigm for Designing Efficient Protocols", Proc. of the 1st ACM Conference on Computer and Communication Security(CCS 1993), pp. 62-73, Nov. 1993.