SGKMP: A scalable group key management protocol (original) (raw)

Distributed Group Key Management with Cluster based Communication for Dynamic Peer Groups

International Journal of Advanced Computer Science and Applications, 2011

Secure group communication is an increasingly popular research area having received much attention in recent years. Group key management is a fundamental building block for secure group communication systems. This paper introduces a new family of protocols addressing cluster based communication, and distributed group key agreement for secure group communication in dynamic peer groups. In this scheme, group members can be divided into sub groups called clusters. We propose three cluster based communication protocols with tree-based group key management. The protocols (1) provides the communication within the cluster by generating common group key within the cluster, (2) provides communication between the clusters by generating common group key between the clusters and (3) provides the communication among all clusters by generating common group key among the all clusters. In our approach group key will be updated for each session or when a user joins or leaves the cluster. More over we use Certificate Authority which guarantees key authentication, and protects our protocol from all types of attacks.

Hybrid Key Management for Group Communications

The International Conference on Electrical Engineering, 2006

Due to the increased popularity of group oriented applications and protocols, securing group communications has become a critical networking issue and has received much attention in recent years. A secure and efficient group key management protocol is the most fundamental challenge in group communication security. While key transport protocols may be appropriate for key establishment in large networks, many collaborative applications require distributed key agreement protocols. Proposals for key agreement protocols that have been published so far does not scale for large size group. In this paper we propose a novel framework for scalable key management protocols in group communication, using both Key Agreement and Key transport protocols. Our framework is based on a particular clustering of the members of the secure communicating group into subgroups. We describe a protocol to achieve this clustering scheme. We describe the architecture and operation of this framework using GDH.2 as a building block. We show that our framework is scalable to large groups with frequent membership changes. 1 Introduction With the widespread use of the Internet, The popularity of Group communication based applications has grown considerably. Group communication is a means of providing multi-point to multi-point communication by organizing processes in groups. Current group-oriented applications include Internet video transmission, stock quotes, news feeds, software updates, live multi-party conferencing, online video games, collaborative workspaces and traversal of insecure networks, basic security services-such as traffic integrity, entity authentication, and

CAKE: An Efficient Group Key Management for Dynamic Groups

2019

With rapid increase of mobile computing and wireless network linkage, the information exchange between connected systems and within groups increases heavily. Exchanging confidential information within groups via unsecured communication channels is a high security threat. In order to prevent third parties from accessing this data, it is essential to encrypt it. For this purpose, the group participants need a common group key to enable encrypted broadcast messages. But efficient key management of secured group communication is a challenging task, if participants rely on low performance hardware and small bandwidth. For coordination and distribution, we present the modular group key management procedure CAKE that is centrally organized and meets strict security requirements. The lightweight G-IKEv2 protocol in combination with the key exchange concept of CAKE leads to an efficiently integrated solution. The hybrid approach combines the advantages of the existing protocols with the objective to reduce the computation and communication effort. It is shown that the procedure is more suitable for changing MANET groups than the existing ones. Moreover, the exchanged group key can be used for any services which provides a wide range of applications.

Scalable and fault-tolerant key agreement protocol for dynamic groups

International Journal of Network Management, 2006

With the widespread use of the Internet, the popularity of group communication-based applications has grown considerably. Since most communications over the Internet involve the traversal of insecure networks, basic security services are necessary for these collaborative applications. These security services can be facilitated if the authorized group members share a common secret. In such distributed applications, key agreement protocols are preferred to key distribution protocols. In the past two decades, there have been many proposals for key agreement protocols. Most of these protocols are not efficient and limit the size of the underlying group. In this paper, we consider the scalability problem in group key agreement protocols. We propose a novel framework based on extension of the Diffie-Hellman key exchange protocol. The efficiency of our protocol comes from the clustering of the group members, where the common session key is established collaboratively by all participants. We present the auxiliary protocols needed when the membership changes. We show that our protocol is superior in complexity in both communication and computation overheads required to generate the session key.

An Efficient Group Key Agreement Protocol for Online Social Network

The objective of this project is to study a group key agreement problem where a user is only aware of his neighbors while the connectivity graph is arbitrary. In our problem, there is no centralized initialization for users. A group key agreement with these features is very suitable for social networks. Under our setting, we construct two efficient protocols with passive security. We obtain lower bounds on the round complexity for this type of protocols, which demonstrate that our constructions are rounding efficient. Finally, we construct an actively secure protocol from a passively secure one.

Group Rekeying Protocol for Secure communication

— Group communication is one of the approaches to impart the messages effectively. Yet, security is the issue for this, and thus keys are utilized to secure the information. In this paper, the key management in group communication, an advanced rekeying approach based on the Logical Key Hierarchy (LKH) and One way Function Tree (OFT) schemes are explained. The AES crypto scheme is used to rekey the keys and the performance of the approach is better than LKH and OFT. Forward and backward security is provided by the proposed rekeying scheme. It is a novel rekeying scheme for large-scale dynamic groups that levers on logical sub-grouping and join history. On contrary other schemes, subgroups only support efficient group key management, have no application meaning and are transparent to the application layer. It misuses the historical backdrop of joining events to build up an aggregate requesting among subgroups and among nodes in every subgroup, so as to effectively recoup from collusion attacks.

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

Computer Networks, 2020

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. gaming, military communication and Internet Protocol television (IPTV), which inspires the development of group communication [1,2]. Group communication allows a host to send data simultaneously to a group of other hosts. This phenomenon prevents the establishment of point-to-point connections amongst the group. Nowadays, application-level group communication has superseded point-to-point communication since it provides the same functionality at a lower cost with minimal deployment efforts. Application-level group communication becomes easier with the advent of wireless mobile technologies which provide efficient installation and compatibility between different services. In general, GBAs require a secure communication channel to avoid disclosure of information to unauthorized users. However, group based communications make use of an open wireless network which is vulnerable to several attacks, resulting in an insecure communication environment. For example, security is of utmost importance in private conferences due to the provision of data confidentiality in a dynamic group membership. This means that only the authorized group members can properly access the data. For this reason, it is necessary to have an efficient key management mechanism, which can efficiently manage a large, dynamic group of mobile users. Key management methods are used for secure key generation and immediate revocation of keys whenever there is a change in the membership. GKs are used for security and privacy reasons, whereby the GKs are shared amongst users of the group as an access control mechanism. A message is encrypted only once for the group and the message is then transmitted to the group and further decrypted using the GK. The data traffic is encrypted with a single key and this key is then distributed to the group using one of the several mechanisms. The GKMP serves to generate, update and distribute the GK and private keys of the users

A SURVEY ON GROUP KEY AGREEMENT FOR SECURELY SHARING A SECRET KEY

Key management, particularly in a group setting, is the corner stone for all other security services. As a result of the increased popularity of group-oriented applications and protocols, group communication occurs in lots of different settings: from network multicasting to application layer teleconferencing and video conferencing. Apart from of the application environment, security services are required for providing communication privacy and integrity. This fundamentally rules out the traditional key distribution paradigm because it calls for superior trust in the group member who generates and distributes keys. We focus on a group key agreement problem with local connectivity, where a user is only aware of his neighbors while the connectivity graph is arbitrary. There is no central authority to initialize the users. A group key agreement with these features is very suitable for social networks. We propose two efficient protocols with passive security: Diffie Hellman Key Agreement (DH-KA) protocol and a private coin tossing protocol protected by Diffie Hellman key (XO-KA). Finally, an actively secure protocol is constructed from a passively secure protocol by developing a two-stage protocol.

Key Management and Group Key Agreement For Fast Transmission To Remote Groups

In newly emerging networks, securely and efficiently broadcasting to a remote cooperative group is a major problem. In this paper, a novel key management approach is proposed to solve this problem. The new approach is a cross of existing broadcast encryption and group key agreement. In this approach, each node maintains a public/secret key pair. By seeing the public/secret key of the node, a sender can securely broadcast to any group. The proposed method is to enable send and leave broadcast to remote cooperative groups. If the non intended members collude, they cannot extract any information from the transmitted messages. The proposed approach provides efficient member deletion/addition, flexible rekeying strategies and is also efficient in terms of communication.

Key management paradigm for mobile secure group communications: Issues, solutions, and challenges

Computer Communications, 2015

Group communication has been increasingly used as an efficient communication mechanism for facilitating emerging applications that require packet delivery from one or many sources to multiple recipients. Due to insecure communication channel, group key management which is a fundamental building block for securing group communication, has received special attention recently. Developing group key management in highly dynamic environments particularly in wireless mobile networks due to their inherent complexities faces additional challenges. On one hand, the constraints of wireless devices in terms of resources scarcity, and on the other hand the mobility of group members increase the complexity of designing a group key management scheme. The article illustrates a survey of existing group key management schemes that specifically consider the host mobility issue in secure group communication in wireless mobile environments. The primary constraints and challenges introduced by wireless mobile environments are identified in order to show their critical influence in designing a secure group communication. The investigated schemes are then compared and analyzed against some pertinent criteria. Finally, the remaining challenges that should be tackled are outlined, and future research directions are also discussed.