SCIENCE CHINA Information Sciences, Volume 60 , Issue 10 : 108301(2017) https://doi.org/10.1007/s11432-015-1045-1

A novel batch-based LKH tree balanced algorithm for group key management

More info
  • ReceivedNov 25, 2016
  • AcceptedDec 29, 2016
  • PublishedApr 27, 2017


There is no abstract available for this article.


This work was supported by National Key Research and Development Program (973 Program) (Grant No. 2016YFB0800100), Nation- al High Technology Research and Development Program of China (863 Program) (Grant No. 2015AA01 6102), Sichuan Province Scientific and Technological Support Project (Grant Nos. 2014GZ0017, 2016GZ0093), National Natural Science Foundation of China (Grant No. 61201128), and Fundamental Research Funds for the Central Universities (Grant No. ZYGX2015J009).


[1] Sakamoto N. An efficient structure for LKH key tree on secure multicast communications. In: Proceedings of IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, Las Vegas, 2014. 1--7. Google Scholar

[2] Teng J K, Wu C K, Tang C M, et al. A strongly secure identity-based authenticated group key exchange protocol. Sci China Inf Sci, 2015, 58: 092108. Google Scholar

[3] Chung Kei Wong , Gouda M, Lam S S. Secure group communications using key graphs. IEEE/ACM Trans Networking, 2000, 8: 16-30 CrossRef Google Scholar

[4] Deuk-Whee Kwak , SeungJoo Lee , JongWon Kim . An efficient LKH tree balancing algorithm for group key management. IEEE Commun Lett, 2006, 10: 222-224 CrossRef Google Scholar

[5] Liu Z H, Lai Y X, Ren X B. An efficient LKH tree balancing algorithm for group key management. In: Proceedings of International Conference on Control Engineering and Communication Technology, Shenyang, 2012. 1003--1005. Google Scholar

[6] Ng W H D, Howarth M, Sun Z. Dynamic balanced key tree management for secure multicast communications. IEEE Trans Comput, 2007, 56: 590-605 CrossRef Google Scholar

  • Figure 1

    (Color online) Rekeying cost, relocating cost and reconstructing cost of our algorithm, LTM and BBA. protectłinebreak (a) Rekeying cost (log); (b) rekeying cost; (c) relocating cost; (d) reconstructing cost.