Group Key Management Protocol Research Articles

Enhancing Cloud Storage Security in Big Data: A Comprehensive Data Sharing Protocol

A cloud based system gives advantage of a storage facility provided by a cloud service provider for exchange of data with authorised users. cloud providers store shared data in huge data centres outside the data owner's trust zone, which may raise the issue of data confidentiality. Number of parties, devices, app in cloud increases so number of access point also increases and making perfect access access control is challenging, so cloud data subject to being deleted or can be modified by cloud service provider. This article offers a secret sharing group key management protocol (SSGK) to prevent unwanted access in the communication process and shared data. in SSGK, group key is utilised to encrypt the shared data, and a secret sharing mechanism is employed to distribute the group key. security and performance evaluations show that our approach significantly reduces the security and privacy concerns of data sharing in cloud storage. Keywords : Big data, Security and Privacy, Cloud Storage, Data Sharing, Encryption, Decryption.

Group Key Management Protocols for Non-Network: A Survey

The phenomenal rise of the Internet in recent years, as well as the expansion of capacity in today's networks, have provided both inspiration and incentive for the development of new services that combine phone, video, and text "over IP." Although unicast communications have been prevalent in the past, there is an increasing demand for multicast communications from both Internet Service Providers (ISPs) and content or media providers and distributors. Indeed, multicasting is increasingly being used as a green verbal exchange mechanism for institution-oriented programmers on the Internet, such as video conferencing, interactive college games, video on demand (VoD), TV over the Internet, e-learning, software programme updates, database replication, and broadcasting inventory charges. However, the lack of security within the multicast verbal exchange model prevents the effective and large-scale adoption of such important company multi-celebration activities. This situation prompted a slew of research projects that addressed a variety of issues related to multicast security, including confidentiality, authentication, watermarking, and access control. These issues should be viewed within the context of the safety regulations that work in the specific conditions. For example, in a public inventory charge broadcast, while identification is a vital necessity, secrecy is not. In contrast, video-convention programme requires both identification and confidentiality. This study gives a complete examination and comparison of the issues of group key management. Both network-dependent and network-independent approaches are used. The study also addresses the advantages, disadvantages, and security problems of various protocols.

Group key management in the Internet of Things: Handling asynchronicity

Internet of Things (IoT) devices have permeated our immediate surroundings, becoming ubiquitous. These devices engage in continuous communication, with a significant aspect being group communications. Indeed, the latter are often more efficient than one-to-one interactions, rendering them well-suited for applications like e-health, federated learning, and military systems. However, security plays a pivotal role in these group communications, especially in safeguarding data confidentiality and user privacy. In this context, group key management protocols offer a mechanism for establishing shared group keys and updating them when needed. Nonetheless, the inherently asynchronous nature of IoT devices has proven to be a challenge. IoT devices are susceptible to unexpectedly entering an offline mode due to factors such as battery depletion, energy conservation, or loss of wireless connectivity. Consequently, the establishment of a group key for secure communications becomes a complex task. In this paper, we introduce an innovative approach to establishing group credentials asynchronously while ensuring robust security attributes, including Perfect Forward Secrecy (PFS) and Post-compromise Security (PCS). Our protocol is designed around blockchain technology, specifically smart contracts to embrace the distributed nature of IoT. Additionally, we incorporate a reputation-based mechanism to address the heterogeneity of IoT devices in terms of resource disparity. Evaluation results demonstrate the feasibility of our approach, along with reasonable performances.

SED-SGC: A scalable, efficient, and distributed secure group communication scheme based on superlattice PUF

A critical challenge in group communication is to guarantee the authenticity, integrity, and confidentiality of sensitive data, especially in scenarios with potential and prospective massive device access, such as the Internet of Everything (IoE). This paper explores a scalable, efficient, distributed secure group communication (SED-SGC) scheme that employs superlattice Physical Unclonable Function (PUF), tree structure, and the Decision Diffie–Hellman Problem. In SED-SGC, superlattice PUF facilitates lightweight, high-security mutual authentication and key generation. The Decision Diffie–Hellman Problem and tree structure construct group key agreement and dynamic member management protocol with logarithmic complexity, achieving forward and backward secrecy. Also, we demonstrate that SED-SGC can effectively guarantee security against multiple attack methods such as collusion attacks, man-in-the-middle attacks (MITM), and impersonation attacks.

A Trust-Based Group Key Management Protocol for Non-Networks

In this paper, a secure and trust-based group key management protocol (GKMP) is presented for non-networks such as MANET/VANET. The scheme provides secure communication for group members in a dynamic network environment and does not restrict the users (registered or non-registered), allowing for flexible group communication. The proposed scheme is designed to address the challenges of key distribution, secure grouping, and secure communication. For result evaluation, first of all formal and informal security analysis was done and then compared with existing protocols. The proposed trust-based GKMP protocol satisfies the authentication, confidentiality of messages, forward/backward security concurrently as well as shows robustness in terms of packet delivery ratio and throughput.

A Critical Study on Group Key Management Protocols and Security Aspects For Non-Networks

The rise in internet usage and advanced communication systems has led to an increase in security issues. The need for more robust and flexible secure communication has led to the introduction of mobile non-network multicast communication systems like MANET or VANET. Multicasting is increasingly being used for group-oriented applications such as video conferencing, interactive games, TV over Internet, e-learning, etc. To address the security concerns, this paper highlighted the confidentiality, authentication, and access control for non-network multicast communication systems like MANET or VANET. For this, paper explores the group key management protocols. The paper concluded that centralized and asymmetric group key management protocol (GKMP) is most effective for designing secure, and efficient communication models for non-networks. The key findings of the paper are that in group key management protocols (GKMPs) for multicast communication systems adoption of asymmetric GKMPs provides better security, and reduces computational overhead. Therefore, this paper help to improve the robustness and security of multicast communication systems and meet the growing demands of group-oriented applications over the internet.

A Novel Decentralized Group Key Management Scheme for Cloud-Based Vehicular IoT Networks

The vehicular internet of things (VIoT) network is connecting smart commuters to elevate traffic problems and effectiveness that help to improve driving conditions for vehicles. Every ITS-based vehicle OBU and commuter might be interchangeable and used to give access permission for the various services during transportation such as infotainment, emergency service, environment service, road condition, etc. These services are suffering from the 1-affect-n problem, scalability, memory resources, computation, and communication overhead. In this paper, the authors proposed a novel decentralized group key management protocol for cloud-based vehicular IoT networks (GVIoTNet) to solve the problem of 1-affect-n and scalability by using the decentralized approach of group key access, key generation, key distribution, key update among vehicles and commuters. Further, by using the master key encryption approach, the average rekeying minimization is 84.84% with the GroupIT scheme. The minimization of rekeying reduces storage overhead and improves computation as well as communication overhead.

Secure Group Communications Using Twisted Group Rings

In this paper we introduce a Group Key Management protocol following the idea of the classical protocol that extends the well-known Diffie–Hellman key agreement to a group of users. The protocol is defined in a non-commutative setting, more precisely, in a twisted dihedral group ring. The protocol is defined for an arbitrary cocycle, extending previous key agreements considered for two users. The main objective of this work is to show that there is no lack of security derived from the fact that a larger amount of public information is known by an external observer.

Secure Message Transmission Using Centralized Group Key Distribution Protocol

Abstract: In the secure message transmission, transmitted information can only receive by the authorized group members. To achieve a secure communication, symmetric key (group key) is used to both encrypt and decrypt the information, that shared among the group members. This paper, proposes an efficient centralized group key management scheme (GKDP) for achieving a secure multicast communication between the group members that reduces the cost of computation of SERVER(S) and rekeying cost of group members. The group key (GK) generated in the multicast network is securely distributed with the help of the RSA cryptosystem. Whenever the new member joins the group, computation cost of S reduced by performing single addition, multiplication and encryption, for updating the group key (GK). Whenever the member leaves the group, S performs single subtraction, division and encryption, for updating the group key (GK). By comparing with existing group key management protocol, the proposed protocol has significantly reduced computation complexity and rekeying cost. The proposed protocol is tested on star topology, the test results compared with existing group key management protocol. The comparison results show that the proposed protocol is efficient in terms of reducing the computational complexity of S and rekeying cost of group members. Index Terms: Secure multicast, rekeying cost, computational complexity, centralized group key management.

Implementation of Authenticated Group Key Management Scheme for Wireless Sensor Networks

The group key management technique is an important technique for cryptographic applications. In this paper, we implemented our proposed method [1] on a group key management protocol for group communication. The proposed protocol is authenticated group key distribution protocol is a mechanism for distributing a group key. We also discussed security analysis and attacks in active and passive adversary model. Also, it ensures semantic security as well as Key freshness of the group key. Along with this, they provide implicit and mutual authentication of the group key. Furthermore, the protocols provide key independence, provide Perfect Forward Secrecy and are resistant to Known Key Attack Implementation of proposed protocol in NS2 simulator.

Centralized Threshold Key Generation Protocol Based on Shamir Secret Sharing and HMAC Authentication.

Many group key management protocols have been proposed to manage key generation and distribution of vehicular communication. However, most of them suffer from high communication and computation costs due to the complex elliptic curve and bilinear pairing cryptography. Many shared secret protocols have been proposed using polynomial evaluation and interpolation to solve the previous complexity issues. This paper proposes an efficient centralized threshold shared secret protocol based on the Shamir secret sharing technique and supporting key authentication using Hashed Message Authentication Code Protocol (HMAC). The proposed protocol allows the group manager to generate a master secret key for a group of vehicles and split this key into secret shares; each share is distributed securely to every group member. -of- vehicles must recombine their secret shares and recover the original secret key. The acceptance of the recovered key is based on the correctness of the received HMAC signature to verify the group manager’s identity and ensure the key confidentiality. The proposed protocol is unconditionally secure and unbreakable using infinite computing power as , or more than secret shares are required to reconstruct the key. In contrast, attackers with secret shares cannot leak any information about the original secret key. Moreover, the proposed protocol reduces the computation cost due to using polynomial evaluation to generate the secret key and interpolation to recover the secret key, which is very simple and lightweight compared with the discrete logarithm computation cost in previous protocols. In addition, utilizing a trusted group manager that broadcasts some public information is important for the registered vehicles to reconstruct the key and eliminate secure channels between vehicles. The proposed protocol reduces the communication cost in terms of transmitted messages between vehicles from messages in previous shared secret protocols to zero messages. Moreover, it reduces the received messages at vehicles from to two messages. At the same time, it allows vehicles to store only a single secret share compared with other shared secret protocols that require storage of secret shares. The proposed protocol security level outperforms the other shared secret protocols security, as it supports key authentication and confidentiality using HMAC that prevents attackers from compromising or faking the key.

Efficient, Flexible and Secure Group Key Management Protocol for Dynamic IoT Settings

For many Internet of Things (IoT) scenarios, group communication in the form of multicasting and broadcasting has proven to be effective. Classical Group Key Management (GKM) schemes perform inefficiently in dynamic IoT environments, wherein nodes frequently leave or join a network or migrate from one group to another. In this paper, we present a highly efficient and secure GKM protocol for dynamic IoT settings, which maintains forward and backward secrecy at all times and is completely resistant to collusion attacks. Also, our protocol is highly flexible and can handle several new scenarios in which device or user dynamics may take place, e.g., allowing a device group to join or leave the network or creation or dissolution of a user group, which are not handled by schemes proposed in prior work. We evaluate the performance of the proposed protocol via extensive mathematical analysis and numerical computations.

Hybrid Broadcast Encryption and Group Key Agreement Protocol with Precise Cipher Texts

In cryptographic system so as to manage the group of members, the group key management protocol is used and it also should provide the security to the group of members which means the communication among the members will be done in secure manner. Broadcast Encryption (BCE) provides a key it arise common for all the members in the group during the encryption and all the associated members can decipher the message with the same mutual key but cannot stop decrypt the message by individuals. Broadcast encipher algorithm sends a secure transmit note to the entire members with the distributed key to decrypt the message with trusted third party. The conventional BE scheme fully relies on third party reliable key generator server machine, the responsibility of the third party server is to generating the undisclosed deciphering keys for the entire collection members and the group members are responsible for decrypt the messages which are encrypted under a common encrypted key. The purpose of Group Key Accord (GKAP) protocol is for negotiate all the assembly members and designing a familiar encryption key through the network. With the GKAP the group members are responsible for generating universal encipher key and it permits simply the group people to decrypt the cipher text which is encrypted by group members by using the shared encryption key but this GKA protocol it is not possible to exclude any members from the group to decrypt the cipher text shared under the common encryption key. In this paper we will combine these two techniques to produce a novel approach called as the Hybrid Broadcast Encryption (HBCE). In this innovative primeval all the cluster of participants agree and produces a widespread encipher key but though each individual having their own decipher key, So that the sender by looking the encryption key he will bound the deciphering to limited members for his abundance.

Corrections to “ALMS: Asymmetric Lightweight Centralized Group Key Management Protocol for VANETs” [Mar 21 1663-1678

In the above article [1] , on pages 11 and 14, math appears incorrectly in some paragraphs.

DM-GKM: A key management scheme for dynamic group based applications

In recent years, group-based applications (GBAs) have gained popularity due to their interesting and promising functionalities such as video on demand, teleconferencing, and pay per view. The advancements in wireless networks and the emergence of mobile devices such as smartphones and tablets have also increased the demands for GBAs.However, the implementation of group key management protocols for GBAs leads to significant computational, storage and communication overheads as well as potential system bottlenecks due to the high mobility of group members. The goal of this research is to address these issues and design a lightweight key management framework that requires fewer computations of keys for dynamic mobile users. A new group key management framework is proposed in this research, which is called the “DynaMic Group Key Management” (DM-GKM) framework. This framework exploits the advantages of the asymmetric key cryptosystem in order to guarantee security and it alleviates the rekeying overhead and distributing the independent Group Key (GK) for each cluster. Simulation and performance analysis demonstrates that the DM-GKM framework fulfils the requirements of a lightweight key management framework for large, dynamic groups of users. An analytical model is also developed to determine the performance and security features of the proposed framework.

ALMS: Asymmetric Lightweight Centralized Group Key Management Protocol for VANETs

Vehicular ad hoc networks (VANETs) were initially designed to assist in traffic management and delivery of safety messages. Due to the significant evolution in modern vehicles, the features offered by VANETs have expanded to include comfort and entertainment relevant services. This expansion has further increased the need to secure them. The security of VANETs is mainly dependent on sharing a cryptographic group key confidentially. Due to the frequent change in group membership, there is a need to update the group key repeatedly, which is difficult in highly dynamic networks like VANETs. Therefore, designing a secure, scalable, and efficient group key management protocol is challenging. Existing group key management protocols introduce a variety of limitations, including high computational cost for both group key computation and retrieval, additional computational and communication overhead when the membership in the group changes, and collusion among receiving vehicles. To overcome these limitations, this paper introduces a novel group key management protocol, ALMS. Performance analysis reveals that, compared to existing protocols, ALMS is more scalable since it introduces a low computational overhead for both the Trusted Authority (TA) and the receiving vehicles. Also, it does not suffer from the key distribution limitation as symmetric key management protocols do. Moreover, ALMS introduces only a light overhead on the TA for group membership change. This is achieved by decoupling the initialization from group key computation and performing it offline without affecting the size of the encrypted group key.

Group Key Management Protocol for File Sharing on Cloud Storage

The large-scale sharing needs of many enterprises promote the development of cloud storage. While the cloud computing stores the shared files outside the trust domain of the owner, the demands and concerns for file security is arising. In this paper, a Group Key Management Protocol for file sharing on cloud storage (GKMP) is proposed. Faced with network attacks from public channel, a group key generation scheme based on mixed encryption technology is proposed. And a verification scheme is used to prevent shared files from being attacked by the collusion attack of cloud providers' and group members'. Security and performance analyses indicate that the proposed protocol is both secure and efficient for data sharing in cloud computing.

Improving performance overhead of a trust-clustering key management protocol in ad hoc networks

Group key management is a challenge for securing group communications in the networks. This area is well studied in the literature. The strict characteristics of mobile ad hoc networks makes the adaptation of classical existing solutions a real challenge. Elliptic curves cryptography (ECC) became the choice of encryption for wireless ad hoc and sensor networks. It uses very small keys and is mathematically very effective, which makes them ideal in communication for small devices used today. Scalability is a basic factor that determines the efficiency of any group key management protocol. Recent solutions for MANETs are oriented towards hierarchical solutions of group key agreement using clustering. Trust oriented clustering scheme is the most adequate for secure group communication. We focus in this paper on ECC technology and its contribution for group key agreement solutions in mobile ad hoc networks using trust criteria for cluster's formation. We propose a novel solution to reduce the group key establishment overhead. The effectiveness of our solution lies in its avoidance of malicious members from being chosen as group controllers (clusterheads). The performance evaluation of the proposed solution shows that is globally satisfactory.

Dynamic group key management scheme for clustered wireless sensor networks

A Group Key Management is a technique to establish shared group key, between the cluster head and sensor nodes for multiple sessions in a clustered network environment. The common use of this established group key (also termed as conference key) is to permit users to encrypt and decrypt a particular broadcast message that is meant for the total user group. In this work, we propose a cluster based dynamic group key management protocol that is based on public key cryptography. Cluster head initiates establishment of group key to the sensor nodes efficiently and achieves secure communication. Later, the computation of the common group key is performed by each sensor node. Group members have functionality to join and leave from particular communication along with this, other nodes, equal to threshold compute new conference key without involvement of cluster head. The proposed protocol is investigated in terms of security and complexity analysis using network simulator (NS-2).

Dynamic group key management scheme for clustered wireless sensor networks

A Group Key Management is a technique to establish shared group key, between the cluster head and sensor nodes for multiple sessions in a clustered network environment. The common use of this established group key (also termed as conference key) is to permit users to encrypt and decrypt a particular broadcast message that is meant for the total user group. In this work, we propose a cluster based dynamic group key management protocol that is based on public key cryptography. Cluster head initiates establishment of group key to the sensor nodes efficiently and achieves secure communication. Later, the computation of the common group key is performed by each sensor node. Group members have functionality to join and leave from particular communication along with this, other nodes, equal to threshold compute new conference key without involvement of cluster head. The proposed protocol is investigated in terms of security and complexity analysis using network simulator (NS-2).