Efficient Group Key Management Research Articles

Retracted: HGKM: An Efficient Hybrid Group Key Management for Unmanned Autonomous Vehicles MBN in Wireless Network Environment

Retracted: HGKM: An Efficient Hybrid Group Key Management for Unmanned Autonomous Vehicles MBN in Wireless Network Environment

HGKM: An Efficient Hybrid Group Key Management for Unmanned Autonomous Vehicles MBN in Wireless Network Environment

Mobile ad hoc networks (MANET) have been seen as a related advancement to Group Key Management (GKM) applications. Remembering the true objective to guarantee amass applications and disallow uncertified clients from getting to the correspondence data that cannot be anchored by a remote MANET, including IP multicast, the singular gathered data content must remain encoded by a typical shared gathering key. Key administration is required to anchor the assurance of gathering the key and to safeguard those gathering data. GKM framework is associated with the remote system condition partners with three issues: execution, security, and system versatility. This article focuses on the Unmanned Aerial Vehicle (UAV)-mobile backbone node (MBN) remote system performance. The UAV-MBN Network condition is a military system that includes a proposal to group an important administrative structure. A half-and-half gathering key administration technique, which works on each target of UAV-MBN, is included in an arrangement to start two basic remote gathering key administration difficulties: (1) operational performance and (2) multiple-enrollment development. By working with minimal small-scale key administration, this strategy can diminish the execution cost associated with the key administration along with the increment operational execution of remote GKM. Scaled-down key organization is carried out in the context of these movement units. The key administration approach also restricted the operational procedure and decreased the operation’s cost in terms of key generation, figuring, and associated correspondence. Overall, the HGKM strategy that has been introduced enhances the operational process and functions effectively in reasonable remote areas.

Comments on ‘Chinese Remainder Theorem‐based centralised group key management for secure multicast communication’

AbstractTo ensure private message exchange among the group members, it is desirable to construct secure and efficient group key management schemes. Moreover, these schemes are more versatile if they could support dynamic join or leave of group members. In IET Information Security 2014, Vijayakumar et al. have introduced such a group key management scheme with lightweight overheads in both computation and communication. And this scheme has been used as a building block in many cryptographic protocols afterwards. In this paper, the authors demonstrate that Vijayakumar's scheme suffers some potential security weaknesses. First, after participating in the group communications for some sessions, a group member may still be able to obtain the group key after it leaves the group, and this violates the claimed security property of forward secrecy. Second, some colluding group members may derive another group member's long term secret key, and obviously, this has more serious consequences. One of the main reasons for the existence of these attacks is that the security analyses in Vijayakumar's scheme are informal and they cannot cover the dynamic environment. To address this issue, the authors’ suggestion is that heuristic arguments of security are not adequate in the design of cryptographic protocols, but formal security definitions and proofs are required.

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.

Hierarchical Blockchain-Based Group and Group Key Management Scheme Exploiting Unmanned Aerial Vehicles for Urban Computing

In urban computing composed of various Internet of Things (IoT) devices, data is collected from IoT as learning data for other IoT devices in a circular structure. Therefore, data are shared resources and crucial in urban computing. In particular, group communication is essential for effective data sharing and for updating software in an IoT system. However, changing the group key is imperative for data security in group communication whenever the group member changes. When the movement of IoTs is high, group key redistribution must be repeated because the group membership keeps changing. In changing and redistributing the group keys, overhead occurs, inevitably degrading system performance. In addition, since much data traffic generates in IoT devices’ crowded areas, transmission delay and data loss could degrade system performance. Due to IoT’s low-power and low-capacity characteristics, one-to-one communication is inefficient, requiring efficient group management and group key management. This work proposes a hierarchical blockchain-based group and group key management scheme to establish an efficient communication environment in urban computing. We adopted blockchains to track the movement and density of IoT and secure node authorization. Using the upper layer blockchain, the unmanned aerial vehicle (UAV) determines the movement and density of IoTs. Using the lower-layer blockchain, base stations (BSs) identify the IoT’s movement of information in each group. We included only nodes determined to be safe in the group. Through the hierarchical blockchain, while protecting the IoT’s privacy, we can record the information in the blockchain to determine the mobility of nodes and the node density of a group. We set several experimental environments, and analyzed the efficiency by simulating the addition of secondary gateways and group integration. As a result, we showed that our proposal establishes an efficient communication environment and reduces computational and communication overhead.

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.

A Secure and Efficient Group Key Management Scheme for Clusters of String Inverters

A string inverter converts the low voltage direct current coming from the string of its Photovoltaic (PV) panels into alternating current to be exported to the grid. In today Smart Grid’s context, PV plants feature clusters of cooperating smart string inverters that exchange information in a multicast fashion (typically) over the Internet Protocol (IP). However, IP multicast does not provide any mechanism to limit the access to multicast data to authorized subjects only. A security infringement may cause a cluster either into exporting no energy into the grid (zero energy attack) or more energy than the limit set (energy overflow attack). Both the attacks can lead to potential severe consequences. In this regard, we are the first addressing those issues. Particularly, we propose a Key Management Service (KMS) for group key generation and distribution. The KMS provides forward secrecy and periodic refresh. We implement a prototype on a cluster of Power-One Italy S.p.A. a member of FIMER Group smart string inverters and evaluate the performance. Experimental results indicate that the scheme scales up to clusters composed of 50 inverters with an efficiency of 90.5% in terms of latency for group key distribution and 99% in terms of memory overhead.

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.

Efficient Group Key Management Using Whale Optimization Algorithm based Elliptic Curve Cryptography for Dynamic Multicast Groups

Efficient Group Key Management Using Whale Optimization Algorithm based Elliptic Curve Cryptography for Dynamic Multicast Groups

Secure Authentication and Group Key Distribution Scheme for WBANs Based on Smartphone ECG Sensor

As one of the crucial components in the emerging internet of things (IoT), wireless body area networks (WBANs) is capable of monitoring vital physiological and behavioral information of users through wearable sensors, offering a new paradigm for the next-generation healthcare systems. However, due to the inherent open wireless communicating characteristics, security and privacy issues for WBANs communication remain unsolved. Note that the deployed WBANs sensors are resource-restrained entities, which restricts its wide applications in medical environment. In this case, effective authentication scheme with efficient group key management strategy is of great significance. Moreover, with comparatively large computation ability and storage capacity, smartphone is able to perform as the vital data processing gateway for WBANs, especially in the upcoming 5G network implementation with superior transmission quality and speed. Furthermore, the WBAN sensors are responsible for continuous physiological monitoring, where the acquired biometric features could be adopted to the authentication process. For the above consideration, a secure certificateless biometric authentication and group key management for WBAN scenarios is proposed in this paper. In our design, user's smartphone takes the role of personal controller (PC) in traditional WBANs structure. The representative features of the gathered electrocardiogram (ECG) records are applied as the distinctive biometric parameter during authentication procedure. Hence efficient authentication towards participating sensors is enabled. Subsequently, fast group key management among all validated sensors is presented, where small modification is required for dynamic key updating mechanism in sensor side. Security analysis indicates that the proposed protocol can achieve desired security properties and provide resistance to various attacks. Performance analysis demonstrates that the proposed protocol is efficient compared with the state-of-the-art WBAN authentication schemes.

A Secure and Efficient Group Key Management Protocol with Cooperative Sensor Association in WBANs.

The wireless body area network (WBAN) is considered as one of the emerging wireless techniques in the healthcare system. Typical WBAN sensors, especially implantable sensors, have limited power capability, which restricts their wide applications in the medical environment. In addition, it is necessary for the healthcare center (HC) to broadcast significant notifications to different patient groups. Considering the above issues, in this paper, the novel practical WBAN system model with group message broadcasting is built. Subsequently, a secure and efficient group key management protocol with cooperative sensor association is proposed. In the proposed protocol, the Chinese remainder theorem (CRT) is employed for group key management between HC and the personal controller (PC), which also supports batch key updating. The proposed sensor association scheme is motivated by coded cooperative data exchange (CCDE). The formal security proofs are presented, indicating that the proposed protocol can achieve the desired security properties. Moreover, performance analysis demonstrates that the proposed protocol is efficient compared with state-of-the-art group key management protocols.

Privacy Preserving Using Diffie-Hellman and An Envelope Protocol Through Key Handling Techniques In Cloud Storage

Cloud computing is unremittingly advancing and demonstrating reliable development in the arena of computing. It is in receipt of fame by giving distinctive computing administrations as distributed storage, cloud facilitating, and cloud servers and so forth for various sorts of enterprises and in addition in scholastics. On the opposite side there are heaps of issues identified with the cloud security and protection. Security is as yet basic test in the distributed computing worldview. These difficulties incorporate client's ambiguity information loss, information spillage and revealing of the individual information security. In view of the security and protection inside the cloud there are different vulnerabilities to the client's sensitive information on cloud storage. In this paper we are considering the risk of storing the data in cloud from third party and accessing the stored data by cloud users, we are proposing a novel mechanism that will give the confidence to cloud user about the security from third party that is cloud service provider and also providing privacy to cloud data users using efficient group key management schema.

Efficient Group Key Management for Non-reliable Link Networks

Some multi communication networks don’t provide a reliable link for group key management, so as to implementing rekeying is failure frequently. To deal with the question, this paper presents a novel group key management scheme for non-reliable link networks, a ciphertext encrypted a secret shared key can be decrypted with any legitimate members whose scale is more than the threshold value, even if part of members’ links aren’t reliable. In rekeying process, each key fragment is divided into two parts with he shared production mechanism, so as to the member’s independent key fragments still keep unchanged, but imperative updated key belongs to the group manager. Therefore, in efficient aspect, the message and computation cost of rekeying is reduced, and the dependence of the reliable channel is reduced; in the security aspect, our proposed scheme can guarantee forward security and backward security, and secure against collusion attack even if the number of leaving member is more than the threshold value. Therefore, our proposed scheme is suitable to the non-reliable link networks.

A Survey on Efficient Group Key Management Schemes in Wireless Networks

Background/Objectives: With the unequalled growth in Wireless networks, the associated fields of group application have also seen growth like multimedia teleconferencing, stock quoting, and distance education. Security in group applications need to be maintained which cannot be accomplished by wireless networks and IP multicast, encryptions by a shared group key is required. In this paper we review on network-independent group key management, which can be classified into three types: centralized, decentralized and distributed group key management protocols. Improvements/Methods: We Analyse key management algorithms in wireless networks and compared various factors of performance like storage overhead, commutation overhead and communication overhead during the join and leave process in groups in wireless group key management approaches, with a set of assessment parameters. In this paper we find various parameters to consider when designing a key management algorithm in wireless networks for mobile environment. Findings: It is important to guarantee the safety of this group key and to ensure the group communication. In spite of the fact that group communication encryption can be utilized to secure messages exchanged among group individuals, distributing the cryptographic keys turn into an issue. However, various significant parameters are used to analysis security requirement of application, when the key management algorithm is developed. Strength of key management algorithms is minimization of key cost during the join/leave process of members in the groups. Applications: In addition, we identify the relationships between the various security issues of wireless group key management like performance, security and network compatibility with regard to the algorithms discussed. It will give better idea about designing key management algorithms with minimum cost like storage, communication and computation parameters when the members join/leave from the groups. It will enable them to take better decisions.

Toward secure large-scale machine-to-machine comm unications in 3GPP networks: chall enges and solutions

With trillions of machines connecting to mobile communication networks to provide a wide variety of applications, supporting a massive number of machine-to-machine (M2M) communications devices has been considered an essential requirement for mobile operators. Meanwhile, cyber security is of paramount importance in M2M as all applications involving M2M cannot be widely accepted without security guarantees. In this article we focus on the standardization activities of 3GPP, especially group-based security for largescale M2M communications in 3GPP networks. We first introduce the main components of the machine-type communication (MTC) security architecture. Then we discuss several major challenges for group-oriented secure M2M communications in 3GPP systems, i.e. authentication signalling congestion and overload, and group message protection. Specifically, we identify the performance issues of authentication signalling congestion and overload in no/low mobility scenarios, and propose three group access authentication and key agreement protocols. Moreover, several 3GPP candidate solutions for group message protection are introduced. Finally, we present key issues and research directions related to group-based secure M2M communications, including security, privacy, and efficiency in mobility scenarios of MTC, and flexible and efficient group key management.

Multi-Service Group Key Management for High Speed Wireless Mobile Multicast Networks

Recently there is a high demand from the Internet Service Providers to transmit multimedia services over high speed wireless networks. These networks are characterized by high mobility receivers which perform frequent handoffs across homogenous and heterogeneous access networks while maintaining seamless connectivity to the multimedia services. In order to ensure secure delivery of multimedia services to legitimate group members, the conventional cluster based group key management (GKM) schemes for securing group communication over wireless mobile multicast networks have been proposed. However, they lack efficiency in rekeying the group key in the presence of high mobility users which concurrently subscribe to multiple multicast services that co-exist in the same network. This paper proposes an efficient multi-service group key management scheme (SMGKM) suitable for high mobility users which perform frequent handoffs while participating seamlessly in multiple multicast services. The users are expected to drop subscriptions after multiple cluster visits hence inducing huge key management overhead due to rekeying the previously visited cluster keys. The already proposed multi-service SMGKM system with completely decentralised authentication and key management functions is adopted to meet the demands for high mobility environment with the same level of security. Through comparisons with existing GKM schemes and simulations, SMGKM shows resource economy in terms of reduced communication and less storage overheads in a high speed environment with multiple visits.

A Centralized Key Table based Communication Efficient Group Key Management Protocol

Group key management is an integral part of secure multicast. Minimizing the number of rekeying messages, maintaining the forward and backward secrecy has always been a challenging task. Though there are many solutions which reduce the rekeying messages from O(n) to O(log2n), they increase with the increase in group size. In this paper, we present a centralized key table based communication efficient group key management protocol in which number of rekeying messages is independent of the group size. In this protocol key management server (KMS) divides a group of n members into n subgroups of size n−1 and maintains a table of n subkeys along with member ID and one group key. Each member has n−1 subkeys, which is a subset of n subkeys of KMS and one group key. The proposed protocol requires only one multicast rekeying message per joining of a new member as well as per eviction of any existing member. As the number of rekeying messages is not dependent on group size, it requires less computation. Index Terms—Group key management, rekeying, subkeys, secure multicast, forward and backward secrecy.

Efficient group key management for secure big data in predictable large‐scale networks

SummaryIt is challenging to secure group communications among large‐scale networks due to their network scale. We observe that in many large‐scale networks, the scale of actual group communication is nevertheless predicable and not very large. For instance, although the entire social network (e.g., Facebook) may have billions of users, the members in a concrete group are usually about tens to hundreds. We manage to secure group communication in such scenarios with efficient group management protocols. Technically, we achieve this goal by using a novel dual‐ring approach in which two rings of nodes are established, one active and one dummy. When some nodes leave, the remaining nodes can replace these nodes with dummy nodes, minimizing the required communications and computations after the protocol is set up and thus providing significant advantage over existing group key management protocols. Formal security arguments show that our protocols are secure under standard computational assumptions. Thorough analysis confirms that our protocols are efficient in computation and communication. Copyright © 2015 John Wiley & Sons, Ltd.

Hybrid Broadcast Group Management Protocol for Secure, Scalable and Efficient Group Communication

In hasty growth of communication, security plays a central role in maintaining confidentiality of data in group communication. Keeping the data intended for the group in confidential manner is the most important security feature need to be sustained for the group communication. An efficient group key management mechanism named as Hybrid Broadcast Group Management Protocol (HBGMP) is devised based on the Reverse Function (RF) and Chinese Remainder Theorem (CRT). The distinctive security among the subgroups is ensured by the reverse function and the session ID of each subgroup is calculated by employing Chinese remainder theorem. By contraption, the Session ID using Chinese Remainder Theorem, with which a cohort of n users requires Sub Group Service Provider (SGSP) to do O (n/m) computation for communication and the storage cost are diminished by diverting the computing load of the Group Service Provider (GSP) into the SGSP. The significance of this protocol is the group member needs to store only two different values during the entire life span and also the rekey message is broadcasted which brings down the communication cost to O(1). The protocol is defined generally for any applications in hybrid architecture. The proposed architecture using CRT and Reverse function is scalable for hefty sized dynamically changing group.

Provably Secure Group Key Management Approach Based upon Hyper-Sphere

Secure group communication systems have become increasingly important for many emerging network applications. An efficient and robust group key management approach is indispensable to a secure group communication system. Motivated by the theory of hyper-sphere, this paper presents a new group key management approach with a group controller (GC). In our new design, a hyper-sphere is constructed for a group and each member in the group corresponds to a point on the hyper-sphere, which is called the member's private point. The GC computes the central point of the hyper-sphere, intuitively, whose “distance” from each member's private point is identical. The central point is published such that each member can compute a common group key, using a function by taking each member's private point and the central point of the hyper-sphere as the input. This approach is provably secure under the pseudo-random function (PRF) assumption. Compared with other similar schemes, by both theoretical analysis and experiments, our scheme (1) has significantly reduced memory and computation load for each group member; (2) can efficiently deal with massive membership change with only two re-keying messages, i.e., the central point of the hyper-sphere and a random number; and (3) is efficient and very scalable for large-size groups.