Skip to main content

Enhanced Strict Binary Logical Key Hierarchy Algorithm for Secure Group Communication

  • Conference paper
  • First Online:
  • 1013 Accesses

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 1025))

Abstract

Logical Key Hierarchy is a scalable and efficient method to achieve logarithmic rekeying cost in secure group communication. In applications like pay per view, video conferencing with multiple rekeying operations, the key tree will be unbalanced and will generate worst-case rekeying cost. With each join, leave operation we change the group key as well as update all keys along the key path of join/leave user. Key aspect in secure group communication is maintaining a balanced key tree and achieving logarithmic rekeying cost. In this paper, a new Strict Binary Logical Key Hierarchy rekeying algorithm is proposed. SBLKH (Strict Binary Logical Key Hierarchy) with proposed Join user algorithm and leave user algorithm maintains the balance of tree and always achieves logarithmic rekeying cost. Our experimental result shows the achieved improvement in rekeying cost of SBLKH join and leave operations compared to original LKH (Logical Key Hierarchy) join and leave operations. Rekeying cost of LKH join/leave is O(log N) and proposed SBLKH join/leave algorithm cost is O(log d), where d is the depth of tree and N is the number of users.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Sakamoto, T., Tsuji, T., Kaji, Y.: Group key rekeying using the LKH technique and the Huffman algorithm. In: 2008 International Symposium on Information Theory and its Applications (2008)

    Google Scholar 

  2. Lu, H.: A novel high-order tree for secure multicast key management. IEEE Trans. Comput. 2 (2005)

    Google Scholar 

  3. Pande, A.S., Joshi, Y.V., Joshi, M.Y.: Analysis on logical key hierarchy and variants for secure group communication. In: ICCASP 2018, Book chapter, Springer-Atalntis, AISR, ISSN 1951-6851

    Google Scholar 

  4. Wong, C.K., Gauda, M., Lam, S.S.: Secure group communications using key graphs. IEEE/ACM Trans. Netw. 8(1), 16–30 (2000)

    Article  Google Scholar 

  5. Vijayakumar, P., Bose, S., Kannan, A.: Centralized key distribution protocol using the greatest common divisor method. Comput. Math Appl. 65, 1360–1368 (2013)

    Article  MathSciNet  Google Scholar 

  6. Chou, K.-Y., Chen, Y.-R., Tzeng, W.-G.: An efficient and secure group key management scheme supporting frequent key updates on Pay-TV systems. In: 2011 13th Asia Pacific Network Operations and Management Symposium (2011)

    Google Scholar 

  7. Zhao, S., Kent, R., Aggarwal, A.: A key management and secure routing integrated framework for ad-hoc networks. Ad-Hoc Netw. (Elsevier) 11, 1046–1061 (2013)

    Google Scholar 

  8. Hanatani, Y., et al.: Secure multicast group management and key distribution in IEEE 802.21. In: Security Standardisation Research, pp. 227–243. Springer International Publishing (2016)

    Google Scholar 

  9. Zhou, H., Zheng, M., Wang, T.: A novel group key scheme for MANETS. Advanced in Control Engineering and Information Science. Proced. Eng. (IJSIA) 3388–3395 (2011)

    Google Scholar 

  10. Wallner, D., Harder, E., Agee, R.: Key management for multicast: issues and architectures. IETF, RFC 2627 (1999)

    Google Scholar 

  11. Hafizul Islam, S.K., Biswas, G.P.: A pairing-free identity-based two-party authenticated key agreement protocol for secure and efficient communication. J. King Saud Univ. Comput. Inf. Sci. 29(1), 63–73 (2017)

    Google Scholar 

  12. Kumar, V., Kumar, R., Pandey, S.K.: A computationally efficient centralized group key distribution protocol for secure multicast communications based upon RSA public key cryptosystem. J. King Saud Univ. Comput. Inf. Sci. (2018)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Aparna S. Pande .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Pande, A.S., Joshi, Y.V., Joshi, M.Y. (2020). Enhanced Strict Binary Logical Key Hierarchy Algorithm for Secure Group Communication. In: Iyer, B., Deshpande, P., Sharma, S., Shiurkar, U. (eds) Computing in Engineering and Technology. Advances in Intelligent Systems and Computing, vol 1025. Springer, Singapore. https://doi.org/10.1007/978-981-32-9515-5_23

Download citation

Publish with us

Policies and ethics