Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

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

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

Abhimanyu Kumar, Sachin Tripathi, Priyanka Jaiswal

Published Aug 1, 2015• 8 citations
Publisher

Abstract

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.

DOI
10.1109/icacci.2015.7275902

Related papers

Two-round ID-based Group Key Agreement Fitted for Pay-TV System

Hyunjue Kim, Nam Junghyun, Kim Seungjoo +1 more

A group key agreement protocol allows a group of user to share a key which may later be used to achieve certain cryptographic goals. In this paper, we propose a new scalable two-round ID-based group key agreement protocol which would be well fit to a Pay-TV system, additionally. to the fields of internet stock quotes, audio and music deliveries, software updates and the like. Our protocol improves the three round poop key agreement protocol of Nam et al., resulting in upgrading the computational efficiency by using the batch verification technique in pairing-based cryptography. Also our protocol simplifies the key agreement procedures by utilizing ID-based system. We prove the security of our protocol under the Computational Diffie-Hellman assumption and the Bilinear Decisional Diffie-Hellman assumption. Also we analyze its efficiency.

Information Security and Cryptology•Jan 1, 2005•0 citations

An Efficient and Secure, ID-based Authenticated, Asymmetric Group Key Agreement Protocol for Ubiquitous Pay-TV Networks

Shaheena Khatoon, Sk. Md. Mizanur Rahman, Raylin Tso +1 more

Internet-of-Things (IoT) based applications are rapidly gaining popularity. Smart home is one of them; home security and safety, home automation, energy management and health surveillance are some applications of smart homes. Smart homes have enormous potential as well as enormous threat to security and privacy of the end users. Pay TV is considered asthe likely entry points for IoT services into smart homes. Pay TV has evolved security techniques very similar to of IoT based smart homes services. Pay TV is an application of broadcast encryption schemes in which premium content is broadcasted only to subscribed users. The broadcaster needs assurance that only subscribed user can access premium content, so the program is encrypted with a group key shared among all subscribers. Thus, to share the key, Pay-TV systems require efficient and secure group key agreement (GKA). This research proposes an efficient and secure, dynamic, ID-based authenticated, asymmetric group key agreement (AAGKA) protocol for Pay-TV networks. Security is proved under the assumptions of the discrete logarithm problem (DLP) and decisional Diffie-Hellman problem (DDHP). Finally, comparison of the protocol with state-of-art protocols shows that the proposed protocol is highly efficient.

網際網路技術學刊•Sep 1, 2020•5 citations

A New Group Key Agreement Protocol with Anonymity

Gang Yao, Li Guo

Popularity of group-oriented applications motivates research on security protection for group communications. A number of group key agreement protocols have been proposed for this objective, but most current group key agreement protocols do not consider privacy protection. Group key agreement protocols for networks should also handle dynamic group membership events such as user join and leave events. The Join and Leave Protocols provide backward and forward secrecy respectively. In this paper, we proposed a new anonymous group key agreement protocol based on ID-based encryption cryptosystems. The proposed protocol not only benefits from the desirable features of ID-based cryptosystem, but also provides privacy protection for users. The proposed protocol achieves the following security attribute: anonymity, unlinkability, group key secrecy, group forward secrecy, group backward secrecy, perfect forward secrecy for the group session key and entity authentication.

Applied Mechanics and Materials•Aug 30, 2013•0 citations

A Flexible ID-Based Group Key Agreement Protocol with Bilinear Pairings

Jun Liang, Hyeong Seon Yoo

A secure and efficient key agreement protocols should provide certain security attributes and low computation overhead. However, most of published protocols cannot provide perfect forward secrecy and avoid key escrow by the Key Generation Center (KGC). In this paper we propose a flexible protocol that can satisfy these security attributes. Moreover the proposed protocol can provide lower computation cost since we can arbitrarily construct subgroups.

CRC Press eBooks•May 7, 2019•0 citations

A novel ID-based authenticated group key agreement protocol using bilinear pairings

Lung-Chung Li, Yao-Pin Tsai, Ru‐Sheng Liu

Recently, several ID-based authenticated group key agreement (AGKA) crytosystems based on bilinear pairings have been proposed. It is an increasingly active research area because of the simplicity of the public key management and the efficiency. However most of the group key agreement protocols have the security and performance weakness. In this paper, we propose an authenticated group key agreement protocol with perfect forward secrecy that requires only one round without verifying signatures. We show that our scheme satisfies all known security requirements, and therefore it is more secure and efficient than other protocols.

IFIP International Conference on Wireless and Optical Communications Networks (WOCN)•May 1, 2008•6 citations

Perfect Forward Secure ID-based Key Agreement Protocol in Group Communication

Pengshuai Qiao

Several identity-based key agreement protocols using bilinear pairing have been proposed in recent years and none of them has achieved all required security properties. In this paper, we firstly propose an ID-based one round authenticated group key agreement protocol with bilinear pairings, where all participants can generate the group session key in one round. Based on the intractability of elliptic curve discrete logarithm problem, every user’s private key can be proved to be secure. Also an extended version of one round authenticated group key agreement protocol is given, it provide perfect forward secrecy and avoid key escrow by the Key Generation Center.  Finally, a comprehensive security analysis and a comprehensive security analysis are provided. By comparing with other protocols, the proposed protocol requires lower computation cost.

Indonesian Journal of Electrical Engineering and Computer Science•Oct 1, 2014•0 citations
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.
A group key agreement protocol allows a group of user to share a key which may later be used to achieve certain cryptographic goals. In this paper, we propose a new scalable two-round ID-based group key agreement protocol which would be well fit to a Pay-TV system, additionally. to the fields of internet stock quotes, audio and music deliveries, software updates and the like. Our protocol improves the three round poop key agreement protocol of Nam et al., resulting in upgrading the computational efficiency by using the batch verification technique in pairing-based cryptography. Also our protocol simplifies the key agreement procedures by utilizing ID-based system. We prove the security of our protocol under the Computational Diffie-Hellman assumption and the Bilinear Decisional Diffie-Hellman assumption. Also we analyze its efficiency.
Internet-of-Things (IoT) based applications are rapidly gaining popularity. Smart home is one of them; home security and safety, home automation, energy management and health surveillance are some applications of smart homes. Smart homes have enormous potential as well as enormous threat to security and privacy of the end users. Pay TV is considered asthe likely entry points for IoT services into smart homes. Pay TV has evolved security techniques very similar to of IoT based smart homes services. Pay TV is an application of broadcast encryption schemes in which premium content is broadcasted only to subscribed users. The broadcaster needs assurance that only subscribed user can access premium content, so the program is encrypted with a group key shared among all subscribers. Thus, to share the key, Pay-TV systems require efficient and secure group key agreement (GKA). This research proposes an efficient and secure, dynamic, ID-based authenticated, asymmetric group key agreement (AAGKA) protocol for Pay-TV networks. Security is proved under the assumptions of the discrete logarithm problem (DLP) and decisional Diffie-Hellman problem (DDHP). Finally, comparison of the protocol with state-of-art protocols shows that the proposed protocol is highly efficient.
Popularity of group-oriented applications motivates research on security protection for group communications. A number of group key agreement protocols have been proposed for this objective, but most current group key agreement protocols do not consider privacy protection. Group key agreement protocols for networks should also handle dynamic group membership events such as user join and leave events. The Join and Leave Protocols provide backward and forward secrecy respectively. In this paper, we proposed a new anonymous group key agreement protocol based on ID-based encryption cryptosystems. The proposed protocol not only benefits from the desirable features of ID-based cryptosystem, but also provides privacy protection for users. The proposed protocol achieves the following security attribute: anonymity, unlinkability, group key secrecy, group forward secrecy, group backward secrecy, perfect forward secrecy for the group session key and entity authentication.
Recently, several ID-based authenticated group key agreement (AGKA) crytosystems based on bilinear pairings have been proposed. It is an increasingly active research area because of the simplicity of the public key management and the efficiency. However most of the group key agreement protocols have the security and performance weakness. In this paper, we propose an authenticated group key agreement protocol with perfect forward secrecy that requires only one round without verifying signatures. We show that our scheme satisfies all known security requirements, and therefore it is more secure and efficient than other protocols.
Several identity-based key agreement protocols using bilinear pairing have been proposed in recent years and none of them has achieved all required security properties. In this paper, we firstly propose an ID-based one round authenticated group key agreement protocol with bilinear pairings, where all participants can generate the group session key in one round. Based on the intractability of elliptic curve discrete logarithm problem, every user’s private key can be proved to be secure. Also an extended version of one round authenticated group key agreement protocol is given, it provide perfect forward secrecy and avoid key escrow by the Key Generation Center.  Finally, a comprehensive security analysis and a comprehensive security analysis are provided. By comparing with other protocols, the proposed protocol requires lower computation cost.