網際網路技術學刊

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, Mohammed F. Alhamid

Published Sep 1, 2020• 5 citations

Abstract

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.

Related papers

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

Abhimanyu Kumar, Sachin Tripathi, Priyanka Jaiswal

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.

International Conference on Advances in Computing, Communications and Informatics (ICACCI)Aug 1, 20158 citations

A group key agreement protocol for intelligent internet of things system

Qikun Zhang, Liang Zhu, Yongjiao Li +4 more

The application of intelligent computing in Internet of Things (IoTs) makes IoTs systems such as telemedicine, in-vehicle IoT, and smart home more intelligent and efficient. Secure communication and secure resource sharing among intelligent terminals are essential. A secure communication channel for intelligent terminals can be established through group key agreement (GKA), thereby ensuring the security communication and resource sharing for intelligent terminals. Taking into account the confidentiality level of the shared resources of each terminal, and the different permissions of the resource sharing of each terminal, a GKA protocol for intelligent IoTs is proposed. Compared with previous work, this protocol mainly has the following advantages: (1) The hidden attribute identity authentication technology can achieve the security of identity authentication and protect personal privacy from being leaked; (2) Only intelligent terminals satisfying the threshold required of the GKA can participate in the GKA, which increases the security of group communication; (3) Low-level group terminals can obtain new permissions to participate in high-level group communication if they meet certain conditions. High-level group terminals can participate in low-level group communication through permission authentication, which increases the flexibility and security of group communication; (4) The intelligent terminals in the group can use their own attribute permission parameters to calculate the group key. They can verify the correctness of the calculated group key through a functional relationship, and does not need to exchange information with other members in the same group. Under the hardness assumption of inverse computational Diffie-Hellman problem and discrete logarithm problem, it is proven that the protocol has high security, and compared with the cited literatures, it has good advantages in terms of computational complexity, time cost and communication energy cost.

International Journal of Intelligent SystemsAug 31, 202146 citations

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 CryptologyJan 1, 20050 citations

An asymmetric group key agreement protocol based on attribute threshold for Internet of Things

Yong Gan, Bingli Wang, Yuan Zhuang +3 more

Abstract With the development of wireless mobile network and Internet of Things (IoT), users enter the network with a large amount of data and information, including some important personal information, such as ID number, telephone number. Personal privacy disclosure has become one of the focuses of attention. In this article, we propose an asymmetric group key agreement (GKA) protocol based on attribute threshold for IoT to protect user privacy. Users do not need to expose any personal information in the group, but only need to meet the same number of attributes and conduct bidirectional authentication registration with key generation center (KGC) to ensure the legitimacy of mobile terminal members participating in GKA. In the registration phase, user performs heavy preliminary calculations according to the designed protocol, thereby reducing the computation in the key agreement phase and decreasing the complexity of the protocol. The protocol can realize self‐verification, and any member participating in key agreement can verify the correctness of the negotiated key by themselves. Under the assumption of bilinear computational Diffie‐Hellman problem, the security of the protocol is proved. Performance analysis further shows that our protocol has lower energy consumption in terms of communication and computing.

Transactions on Emerging Telecommunications TechnologiesNov 25, 20209 citations

A Provably Secure and Lightweight Identity-Based Two-Party Authenticated Key Agreement Protocol for IIoT Environments

Daya Sagar Gupta, SK Hafizul Islam, Mohammad S. Obaidat +3 more

With the significant development of the Internet, Internet of Things (IoT) has become an emerging technology in many industries. To support security and privacy in the Industrial IoT environment, a user may interact with another user on the Internet to share confidential information, which requires an authenticated communication channel. To meet this demand, in this article the authors developed an identity-based two-party authenticated key agreement (ID-2PAKA) protocol that allows two users to communicate securely and share sensitive data across IoT-enabled regions. Similar protocols found in the literature either proven to be insecure or carry the burden of high communication and computational costs. The proposed ID-2PAKA protocol is analyzed in the random oracle model to achieve provable security based on the hardness assumptions of computational Diffie-Hellman and bilinear Diffie-Hellman problems. The performance analysis of the proposed ID-2PAKA protocol is performed using the pairing-based cryptography library. The comparative results from the perspective of the computation and communication costs against the competing protocols showed that the proposed ID-2PAKA protocol is secure and efficient.

IEEE Systems JournalJul 3, 202085 citations

Identity-Based Authenticated Asymmetric Group Key Agreement Protocol.

Lei Zhang, Qianhong Wu, Bo Qin +1 more

Abstract. In identity-based public-key cryptography, an entity’s public key can be easily derived from its identity. The direct derivation of public keys in identity-based public-key cryptography eliminates the need for certificates and solves certain public key management problems in traditional public-key cryptosystems. Recently, the notion of asymmetric group key agreement was introduced, in which the group members merely negotiate a common encryption key which is accessible to any entity, but they hold respective secret decryption keys. In this paper, we first propose a security model for identity-based authenticated asymmetric group key agreement (IB-AAGKA) protocols. We then propose an IB-AAGKA protocol which is proven secure under the Bilinear Diffie-Hellman Exponent assumption. Our protocol is also efficient, and readily adaptable to provide broadcast encryption.

Jan 1, 20100 citations