An efficient and secure group key management scheme supporting frequent key updates on Pay-TV systems

Chou, K.L.; Chen, Yi-Ruei; Tzeng, Wen-Guey

doi:10.1109/apnoms.2011.6077025

Cited by 14 publications

(14 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The proposed protocol satisfies the specific requirements for a Pay-TV system as discussed in [1] and [2], have less computational overheads than others existing protocols and free from the bilinear pairing, which is identified as a more complex mathematical operation. The present paper also gives the security justification of proposed protocol which shows that it is secure against various attacks.…”

Section: Introductionmentioning

confidence: 89%

Design of efficient ID-based group key agreement protocol suited for Pay-TV application

Kumar

Tripathi

Jaiswal

2015

2015 International Conference on Advances in Computing, Communications and Informatics (ICACCI)

View full text Add to dashboard Cite

Pay-TV application is one of the challenging home appliances where a TV program is delivered to a group of customers. The broadcaster of the Pay-TV system needs to assure that only legitimate subscribers/customers can watch the subscribed TV program. To deliver a TV program confidentially to its subscribers, the broadcaster may encrypt the program by a group key shared by all subscribers. Thus the Pay-TV system often requires a group key establishment protocol to establish a symmetric key among all the subscribers subscribing for a particular program. The group key agreement protocol for Pay-TV system presented so far are requires bilinear pairing computations which creates a big overhead for subscribers specially in wireless environment. A protocol is suitable for Pay-TV system only when most of the computational load are shifted to the broadcaster than the subscribers because the subscribers may have less computational resources as compared to the broadcaster. The present paper proposes an ID-based group key agreement protocol suitable for the Pay-TV system without using bilinear pairing. The proposed protocol also have efficient join and leave procedures to allow dynamic subscriptions with forward and backward secrecy. Moreover, the security of the proposed protocol is justified with respect to the necessary security attributes. Finally the performance of proposed protocol has been compared with some other existing protocols which shows that the proposed protocol has comparable communication and computation cost with zero pairing computation. 978-1-4799-8792-4/15/$31.00 c 2015 IEEE

show abstract

Section: Introductionmentioning

confidence: 89%

Design of efficient ID-based group key agreement protocol suited for Pay-TV application

Kumar

Tripathi

Jaiswal

2015

2015 International Conference on Advances in Computing, Communications and Informatics (ICACCI)

View full text Add to dashboard Cite

show abstract

“…KDC uses a tree called Logical Key Hierarchy (LKH) or key tree for group key management. The tree based scheme in [6] uses KDC. Research on group key agreement protocols started in 1982.…”

Section: Introductionmentioning

confidence: 99%

Secure group key management scheme based on dual receiver cryptosystem

Purushothama

Amberker

2013

Proceedings of the First ACM Workshop on Asia Public-Key Cryptography

View full text Add to dashboard Cite

Providing the confidentiality to the messages delivered between group members in secure group communication model is a critical networking issue. Key management is a challenging task in secure group communication. Tree based group key management scheme is believed to provide a very powerful approach for group key management. In this paper, we provide a new approach to group key management based on the dual receiver crypto system in which a sender can encrypt a message that can be decrypted by two receivers. The proposed scheme is a distributed scheme and uses the key tree to manage the keys. Some of the existing distributed schemes assume the key tree as binary and ternary. Our scheme can be extended to key tree of varying degree. For a group with n users, only two encryptions are needed for rekeying during member join event and ≤ d 3 log d n (d > 1 is degree) encryptions are required for rekeying upon user leave event. We compare the proposed scheme with the other tree based distributed schemes and show that the proposed scheme is efficient.

show abstract

“…The number of users is often large in cloud-based services. One solution to deal with this issue is to apply a treebased group key management (GKM) scheme [10,11,28] to maintain the common distribution-key among a dynamic set of users at each class. The GKM scheme reduces the computation and communication cost from O(n i ) to O(lg n i ), where n i is the number of users in SC i .…”

Section: Scalable Rekey Mechanism For Large Number Of Usersmentioning

confidence: 99%

“…The GKM scheme reduces the computation and communication cost from O(n i ) to O(lg n i ), where n i is the number of users in SC i . In particular, the GKM schemes in [10,11] have an efficient rekey mechanism for a user who may miss key update messages in his off-line period. The methods are suitable in handing frequent rekey operations.…”

Section: Scalable Rekey Mechanism For Large Number Of Usersmentioning

confidence: 99%

CloudHKA: A Cryptographic Approach for Hierarchical Access Control in Cloud Computing

Chen

Chu

Tzeng

et al. 2013

Applied Cryptography and Network Security

Self Cite

View full text Add to dashboard Cite

Abstract. Cloud services are blooming recently. They provide a convenient way for data accessing, sharing, and processing. A key ingredient for successful cloud services is to control data access while considering the specific features of cloud services. The specific features include great quantity of outsourced data, large number of users, honest-but-curious cloud servers, frequently changed user set, dynamic access control policies, and data accessing for light-weight mobile devices. This paper addresses a cryptographic key assignment problem for enforcing a hierarchical access control policy over cloud data. We propose a new hierarchical key assignment scheme CloudHKA that observes the BellLaPadula security model and efficiently deals with the user revocation issue practically. We use CloudHKA to encrypt outsourced data so that the data are secure against honest-butcurious cloud servers. CloudHKA possesses almost all advantages of the related schemes, e.g., each user only needs to store one secret key, supporting dynamic user set and access hierarchy, and provably-secure against collusive attacks. In particular, CloudHKA provides the following distinct features that make it more suitable for controlling access of cloud data.(1) A user only needs a constant computation time for each data accessing. (2) The encrypted data are securely updatable so that the user revocation can prevent a revoked user from decrypting newly and previously encrypted data. Notably, the updates can be outsourced by using public information only. (3) CloudHKA is secure against the legal access attack. The attack is launched by an authorized, but malicious, user who pre-downloads the needed information for decrypting data ciphertexts in his authorization period. The user uses the pre-downloaded information for future decryption even after he is revoked. Note that the pre-downloaded information are often a small portion of encrypted data only, e.g. the headercipher in a hybrid encrypted data ciphertext. (4) Each user can be flexibly authorized the access rights of Write or Read, or both.

show abstract

An efficient and secure group key management scheme supporting frequent key updates on Pay-TV systems

Cited by 14 publications

References 12 publications

Design of efficient ID-based group key agreement protocol suited for Pay-TV application

Design of efficient ID-based group key agreement protocol suited for Pay-TV application

Secure group key management scheme based on dual receiver cryptosystem

CloudHKA: A Cryptographic Approach for Hierarchical Access Control in Cloud Computing

Contact Info

Product

Resources

About