Skip to main content
SpringerLink
Log in

A Computationally Efficient and Scalable Key Management Scheme for Access Control of Media Delivery in Digital Pay-TV Systems

  • Published:
Multimedia Tools and Applications Aims and scope Submit manuscript

A Correction to this article was published on 10 October 2020

This article has been updated

Abstract

In today’s Internet era, group communications in multimedia applications are becoming more and more popular. The issues of controlling illegal access to multimedia contents require efficient and secure mechanisms for distribution of common key called scrambling key or group key. In order to provide secure delivery of multimedia contents in digital pay-TV systems, a large number of keying information messages are exchanged for group key/scrambling key updates in the traditional key distribution schemes. In this paper we propose a Chinese Remainder Theorem (CRT) based key distribution protocol which is highly secure and computationally efficient. The proposed protocol, 1) has drastically reduced the computational complexity of Group Manager (GM) and members for updating the keys, 2) has greatly increased the security by using an additional secret parameter at Group Manager and members areas, 3) can efficiently handle large and dynamically updating groups and, 4) can update the group key in one message, without updating member’s key. With our proposed key distribution scheme, only legal members can access the multimedia contents correctly and the illegal access can be prevented. The proposed scheme is applicable in Conditional Access System (CAS) of digital pay-TV systems without increasing storage and communication overheads on GM and members. The comparative analysis of our proposed scheme with existing schemes in terms of computational cost assures the effectiveness of our scheme. As a proof of concept, we implement our scheme to a decentralized architecture-based key management system and demonstrate that the proposed scheme significantly reduces the computational complexity.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3.
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12

Similar content being viewed by others

Change history

  • 10 October 2020

    Tables 1, 3, 4, 5, 6, 7, 8 and the body texts in the original publication contain incorrect symbols. The original article article has been corrected.

References

  1. Chen SM, Yang CY, Hwang MS (2017) Using a new structure in group key management for pay-TV. International Journal of Network Security 19(1):112–117

    Google Scholar 

  2. Farash MS, Attari MA (2016) A provably secure and efficient authentication scheme for access control in mobile pay-TV systems. Multimed Tool Appl 75(1):405–424

    Article  Google Scholar 

  3. He D, Kumar N, Shen H, Lee JH (2016) One-to-many authentication for access control in mobile pay-tv systems. Sci China Inf Sci 59. https://doi.org/10.1007/s11432-015-5469-5

  4. Huang Y-L, Shieh S, Ho F-S, Wang J-C (Oct. 2004) Efficient key distribution schemes for secure media delivery in pay-TV systems. in IEEE Transactions on Multimedia 6(5):760–769. https://doi.org/10.1109/TMM.2004.834861

    Article  Google Scholar 

  5. Je DH, Kim H-S, Choi Y-H, Seo SW (2014) Dynamic configuration of batch rekeying interval for secure multicast service, 2014 International Conference on Computing, Networking and communications (ICNC), Honolulu, HI, pp. 26–30. doi: https://doi.org/10.1109/ICCNC.2014.6785299.

  6. Joshi MY, Bichkar RS (2013) Scalable Key Transport Protocol Using Chinese Remainder Theorem‖, The Proceedings of International symposium on Security in Computers and Communications (SSCC), Mysore, pp 397–402

  7. Kim J, Choi H (June 2010) Improvements on Sun 's conditional access system in pay-TV broadcasting systems. in IEEE Transactions on Multimedia 12(4):337–340. https://doi.org/10.1109/TMM.2010.2046362

    Article  Google Scholar 

  8. Kumar V, Kumar R, Pandey SK, An Enhanced and Secured RSA Public Key Cryptosystem Algorithm Using Chinese Remainder Theorem, third International Conference, NGCT 2017, Smart and Innovative Trends in Next Generation Computing Technologies, Communications in Computer and Information Science(CCIS), pp. 1–12, doi: https://doi.org/10.1007/978-981-10-8660-1_42.

  9. Kumar V, Kumar R, Pandey SK (2018) A computationally efficient centralized group key distribution protocol for secure multicast communications based upon RSA public key cryptosystem. Journal of King Saud University – Computer and Information Sciences. https://doi.org/10.1016/j.jksuci.2017.12.014

  10. Kumar V, Kumar R, Pandey SK (2018) Polynomial based non-interactive session key computation protocol for secure communication in dynamic groups, International Journal of Information Technology pp 1–6, doi:https://doi.org/10.1007/s41870-018-0140-1.

  11. Kumar V, Kumar R, Pandey SK, Alam M Fully homomorphic encryption scheme with probabilistic encryption based on euler’s theorem and application in cloud computing. In: Aggarwal, V.B., Bhatnagar, V., Mishra, D.K. (eds.) Big Data Analytics. AISC, vol. 654, pp. 605–611. Springer, Singapore (2018). https://doi.org/10.1007/978-981-10-6620-7_58.

  12. Kumar V, Kumar R, Pandey SK (2020) An Efficient and Scalable Distributed Key Management Scheme Using Ternary Tree for Secure Communication in Dynamic Groups. In: Singh P., Panigrahi B., Suryadevara N., Sharma S., Singh A. (eds) Proceedings of ICETIT 2019. Lecture notes in electrical engineering, vol 605. Springer, Cham doi: https://doi.org/10.1007/978-3-030-30577-2_13

  13. Li M, Poovendran R, Berenstein C (2002) Design of Secure Multicast key Management Schemes with communication budget constraint. IEEE communication letters 6(3):108–110. https://doi.org/10.1109/4234.991148

    Article  Google Scholar 

  14. Lin I-C, Tang S-S, Wang C-M (September 2010) Multicast key management without rekeying processes. Comput J 53(7):939–950

    Article  Google Scholar 

  15. Z. Liu, Y. Lai, X. Ren and S. Bu (2012) An Efficient LKH Tree Balancing Algorithm for Group Key Management, 2012 International conference on control engineering and communication technology, Liaoning, pp.1003–1005. doi: https://doi.org/10.1109/ICCECT.2012.213.

  16. McGrew DA, Sherman AT (2003) Key establishment in large dynamic groups using one-way function trees. IEEE Trans Softw Eng 29(5):444–458

    Article  Google Scholar 

  17. Naranjo JAM, Lopez-Ramos JA, Casado LG (2010) Applications of the extended Euclidean algorithm to privacy and secure communications, in: proceedings of the 10th international conference on computational and mathematical methods in science and engineering, CMMSE

  18. Pal O, Alam B (2019) Efficient and secure conditional access system for pay-TV systems. Multimed Tools Appl 78:18835–18853. https://doi.org/10.1007/s11042-019-7257-5

    Article  Google Scholar 

  19. Saravanan K, Purusothaman T (2012) Efficient star topology based multicast key management algorithm. J Comput Sci 8(6):951–956

    Article  Google Scholar 

  20. Sun HM, Chen CM, Shieh CZ (2008) Flexible-pay-per-channel: a new model for content access control in pay-TV broadcasting systems. IEEE Trans Multimed 10(6):1109–1120

    Article  Google Scholar 

  21. Tang S, Xu L, Liu N, Huang X, Ding J, Yang Z (Dec. 2014) Provably secure group key management approach based upon hyper-sphere. in IEEE Transactions on Parallel and Distributed Systems 25(12):3253–3263. https://doi.org/10.1109/TPDS.2013.2297917

    Article  Google Scholar 

  22. Varalakshmi R, Rhymend Uthariaraj V (2013) Huffman based conditional access system for key distribution in digital. TV multicast Multimed Tools Appl 74(9):2899–2912. https://doi.org/10.1007/s11042-013-1753-9

    Article  Google Scholar 

  23. Vijaya Kumar P, Bose S, Kannan A (2013) Centralized Key Distribution Protocol using the Greatest Common Divisor Method, Computers & Mathematics with Applications, 2013 Volume 65, Issue 9. Pages: 1360–1368, doi:https://doi.org/10.1016/j.camwa.2012.01.038.

  24. VijayaKumar P, Bose S, Kannan A (2012) Rotation based secure multicast key management for batch rekeying operations. Netw Sci 1(1–4):39–47

    Article  Google Scholar 

  25. VijayaKumar P, Bose S, Kannan A (2014) Chinese remainder theorem based centralized group key management for secure muticast communication. IET Inf Secur 8(3):179–187. https://doi.org/10.1049/iet-ifs.2012.0352

    Article  Google Scholar 

  26. Vijayakumar P, Naresh R, Islam SK, Deborah LJ (2016) An effective key distribution for secure internet pay-TV using access key hierarchies. J Secur Commun Netw. https://doi.org/10.1002/sec.1680

  27. Wang H, Qin B (Dec. 2012) Improved one-to-many authentication scheme for access control in pay-TV systems. in IET Information Security 6(4):281–290. https://doi.org/10.1049/iet-ifs.2011.0281

    Article  Google Scholar 

  28. Yeh L, Tsaur W (2012) A secure and efficient authentication scheme for access control in Mobile pay-TV systems. in IEEE Transactions on Multimedia 14(6):1690–1693. https://doi.org/10.1109/TMM.2012.2199290

    Article  Google Scholar 

  29. Zhang J, Varadharajan V (2010) Wireless sensor network key management survey and taxonomy. Journal of Network and Computer Applications 33(2):63–75

    Article  Google Scholar 

  30. Zheng XL, Huang CT, Matthews M (2007) Chinese remainder theorem based group key management, in Proc. 45th ACMSE, Winston-Salem, NC, USA, 266–271.

Download references

Author information

Authors and Affiliations

  1. Department of Electronics and Communication (Computer Science & Engineering), University of Allahabad, Allahabad, UP, India

    Vinod Kumar

  2. Department of Computer Science, Jamia Millia Islamia, New Delhi, India

    Rajendra Kumar

  3. Division of e-Governance, Ministry of Electronics & Information Technology (Government of India), New Delhi, India

    S. K. Pandey

Authors
  1. Vinod Kumar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rajendra Kumar
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. S. K. Pandey
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Vinod Kumar.

Additional information

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

The original version of this article was revised: Table 1 contains incorrect symbols.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kumar, V., Kumar, R. & Pandey, S.K. A Computationally Efficient and Scalable Key Management Scheme for Access Control of Media Delivery in Digital Pay-TV Systems. Multimed Tools Appl 80, 1–34 (2021). https://doi.org/10.1007/s11042-020-08904-8

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11042-020-08904-8

Keywords

Search

Navigation