Proposed Group Key Management Research Articles

A Scalable and Secure Group Key Management Method for Secure V2V Communication.

Safety applications based on vehicle-to-everything (V2X) communications can significantly enhance road safety and reduce traffic fatalities. Ensuring the security and privacy of the vehicular network is essential for the widespread adoption of V2X communications for commercial use. V2X safety and service applications require periodic broadcast communications among all the vehicles. However, compared to unicast communication, it is extremely challenging to provide broadcast communication with network security requirements such as confidentiality, in infotainment contents distribution, sensor data sharing, and security credentials management services. To address the providing confidentiality of vehicle-to-vehicle (V2V) broadcasting, we propose a group key management and message encryption method that is secure, lightweight, and scalable. The proposed group key management method can efficiently handle various scenarios like a node joining or leaving the group, with scalable rekeying algorithms. It employs a distributed and scalable architecture that offers several advantages such as the reduction of the key management overhead and the enhancement of the security level by keeping the key sizes with large networks. In addition, the proposed method employs a lightweight matrix-based encryption algorithm that can be easily applicable with the proposed group key management method. Further, we have implemented the proposed method and evaluated the performance using a V2V network simulator with several networks of highly dynamic group members. The simulation results show that the proposed method can reduce computation time for group key generation and message encryption by more than 80% compared to existing methods.

An Efficient Genetic Based Broadcast Stateless Group Key Management Scheme with Dynamic Rekeying in Mobile Ad-Hoc Networks

This paper addresses the issue in managing a group key among dynamic group of nodes in Mobile Ad hoc Networks (MANETs), where the participants frequently miss the group key update, commonly known as rekeying. In this paper, we propose a broadcast stateless and distributed Group Key Management framework: Genetic based Group Key Agreement scheme, for supporting dynamic rekeying mechanism in MANET. The rekeying scheme operates with hash functions and Lagrange interpolation polynomial implementation over finite area for group key establishment. Moreover, to provide a strong security mechanism, a revocation system is presented to gather accurate rate of node misbehaviours. The simulation results show that the proposed group key management scheme achieved higher performance and security compared with other existing key management schemes. Moreover, the scheme detects both selfish and malicious attacks fairly at lower overhead.

Provably secure group key management scheme based on proxy re-encryption with constant public bulletin size and key derivation time

Users share a group key to decrypt encryptions for the group using a group key management scheme. In this paper, we propose a re-encryption-based group key management scheme, which uses a unidirectional proxy re-encryption scheme with special properties to enable group members share the updated group key with minimum storage and computation overhead. In particular, we propose a proxy re-encryption scheme that supports direct re-encryption key derivation using intermediate re-encryption keys. Unlike multi-hop re-encryption, the proposed proxy re-encryption scheme does not involve repeated re-encryption of the message. All the computations are done on the re-encryption key level and only one re-encryption is sufficient for making the group key available to the users. The proposed scheme is the first for group key management based on proxy re-encryption that is secure against collusion. The individual users store just one individual secret key with group key derivation requiring O\((\log N)\) computation steps for a group of N users. Size of the public bulletin maintained to facilitate access to the most recent group key for off-line members is O(N) and remains constant with respect to the number of group updates. The proposed group key management scheme confronts attacks by a non-member and even a collusion attack under standard cryptographic assumptions.

A novel scheme for secure group communication in multicast network

Group key management is an important framework and functional building block for any secure multicast architecture. To improve the performance and scalability of rekeying for group key management in large-scale systems, a novel scheme was proposed. In this paper, we present dynamic and large-scale groups, and the overhead of key generating and key updating is usually relevant to the group size, which becomes a performance bottleneck in achieving scalability. The overhead of key management can be shared by the sub-group controller (SGC) and group controller, and in addition, the new protocol conduces to constant computation and communication overhead during rekeying and enhances more security. Users in the systems are grouped into sub-groups based on their subscription span. The inter-group and intra-group communication is done with the help of group key and sub-group key, respectively. An analysis shows that the cost of rekeying operations is reduced and security breaches have been reduced with the proposed group key management.

Analyses of several recently proposed group key management schemes

ABSTRACTDesigning group key management schemes is a troubled field. In this paper, we review three schemes recently proposed, including Kayam's scheme for groups with hierarchy, Piao's group key management (KM) scheme, Purushothama's group KM schemes. We point out the problems in each scheme. Kayam's scheme is not secure to collusion attack. Piao's group KM scheme is not secure. The hard problem it bases is not really hard, and the way their scheme uses a hard problem is improper. Purushothama's scheme has an unnecessary design that costs lots of resources and does not give an advantage to the security level and dynamic efficiency of it. We also briefly analyze the underlying reasons why these problems emerge and give suggestions on designing. Copyright © 2014 John Wiley & Sons, Ltd.

멀티캐스트 전송을 위한 키 체인 기반의 안전한 그룹 키 관리방안 연구

최근 화상회의, 인터넷방송, 온라인 게임등 대규모의 데이터를 여러사용자에게 동시에 전송하는 애플리케이션이 증가함으로 인해 그룹 통신의 중요성 및 활용도가 높아지게 됨에 따라 그에 대한 보안이 중요한 문제로 인식되게 되었다. 멀티캐스트 환경에서 보안성을 제공하기 위해 기존의 하나의 그룹 관리 서버를 통해 키 트리 기반의 프로토콜을 이용한 연구가 많지만, 제안하는 논문에서는 상대적으로 오버헤드가 적은 안전한 그룹키 관리 기법을 제안하고자 한다. 따라서 제안하는 논문에서는 기존의 그룹키 관리기법과의 차별성 및 효율성을 비교하여 우수성을 입증한다. Because the application simultaneously to transmit large amounts of data (Video conferencing, Internet broadcasting, Online games etc.) to multiple users increases, the importance and utilization of group communication was greater. So the security was recognized as a important issue. To provide security in multicast environment, A study of single group management server using protocol based on Key Tree Scheme was proposed. But the paper proposes secure group key management scheme to be a relatively low-overhead. Therefore proposed paper is demonstrated to be excellent by comparing the effectiveness of existing and proposed group key management scheme.

Group key agreement efficient in communication

In recent years, collaborative and group-oriented applications and protocols have gained popularity. These applications typically involve communication over open networks; security thus is naturally an important requirement. Group key management is one of the basic building blocks in securing group communication. Most prior research in group key management focused on minimizing computation overhead, in particular minimizing expensive cryptographic operations. However, continued advances in computing power have not been matched by a decrease in network communication delay. Thus, communication latency, especially in high-delay long-haul networks, increasingly dominates the key setup latency, replacing computation delay as the main latency contributor. Hence, there is a need to minimize the size of messages and, especially, the number of rounds in cryptographic protocols. Since most previously proposed group key management techniques optimize computational (cryptographic) overhead, they are particularly impacted by high communication delay. In this work, we discuss and analyze a specific group key agreement technique which supports dynamic group membership and handles network failures, such as group partitions and merges. This technique is very communication-efficient and provably secure against hostile eavesdroppers as well as various other attacks specific to group settings. Furthermore, it is simple, fault-tolerant, and well-suited for high-delay networks.