Key Management Protocol Research Articles

Distributed Group Key Management Protocol over Non-commutative Division Semirings

In this paper, we propose new method for group key distribution among 'four' persons using polynomials over noncommutative division semirings. We generate the common key or group key using polynomial symmetric decomposition problem. Security of the proposed protocol is based on PSDP over non-commutative division semirings. This can be extended to a group of 'n' persons also in similar fashion.

Distributed Group Key Management Protocol over Non-commutative Division Semirings

In this paper, we propose new method for group key distribution among 'four' persons using polynomials over noncommutative division semirings. We generate the common key or group key using polynomial symmetric decomposition problem. Security of the proposed protocol is based on PSDP over non-commutative division semirings. This can be extended to a group of 'n' persons also in similar fashion.

Efficient Authentication and Key Management Mechanisms for Smart Grid Communications

A smart grid (SG) consists of many subsystems and networks, all working together as a system of systems, many of which are vulnerable and can be attacked remotely. Therefore, security has been identified as one of the most challenging topics in SG development, and designing a mutual authentication scheme and a key management protocol is the first important step. This paper proposes an efficient scheme that mutually authenticates a smart meter of a home area network and an authentication server in SG by utilizing an initial password, by decreasing the number of steps in the secure remote password protocol from five to three and the number of exchanged packets from four to three. Furthermore, we propose an efficient key management protocol based on our enhanced identity-based cryptography for secure SG communications using the public key infrastructure. Our proposed mechanisms are capable of preventing various attacks while reducing the management overhead. The improved efficiency for key management is realized by periodically refreshing all public/private key pairs as well as any multicast keys in all the nodes using only one newly generated function broadcasted by the key generator entity. Security and performance analyses are presented to demonstrate these desirable attributes.

Self-organized public key management in MANETs with enhanced security and without certificate-chains

In the self-organized public key management approaches, public key verification is achieved through verification routes constituted by the transitive trust relationships among the network principals. Most of the existing approaches do not distinguish among different available verification routes. Moreover, to ensure stronger security, it is important to choose an appropriate metric to evaluate the strength of a route. Besides, all of the existing self-organized approaches use certificate-chains for achieving authentication, which are highly resource consuming. In this paper, we present a self-organized certificate-less on-demand public key management (CLPKM) protocol, which aims at providing the strongest verification routes for authentication purposes. It restricts the compromise probability for a verification route by restricting its length. Besides, we evaluate the strength of a verification route using its end-to-end trust value. The other important aspect of the protocol is that it uses a MAC function instead of RSA certificates to perform public key verifications. By doing this, the protocol saves considerable computation power, bandwidth and storage space. We have used an extended strand space model to analyze the correctness of the protocol. The analytical, simulation, and the testbed implementation results confirm the effectiveness of the proposed protocol.

A Comparative Study of Key Management Protocols for WSN

A Comparative Study of Key Management Protocols for WSN

Special Issue on Advances in Trust, Security and Privacy for Wireless and Mobile Networks

The advances in wireless communication technologies and mobile devices have provided cost-effective platforms and environments for people to have better and ubiquitous interpersonal communications. The trust, security and privacy issues in such an environment have drawn significant attention recently from both academia and industry. The accepted papers in this special issue are devoted to the most recent developments and research addressing related theoretical and practical aspects on trust, security and privacy for wireless and mobile networks, and the contents are built on analytical modelling, experimental and simulation studies. The contributions of these papers are outlined below. People-centric sensing (PCS) is an emerging and promising paradigm of sensor networks, but faces severe security problems due to the strong connectivity and homogeneous applications. Lu et al. propose a novel behavioural signature generation system, called SimBehavior, to generate lightweight behavioural signature for malware detection in PCS. Unlike malware detection using behaviour graph which is NP-Complete, the proposed SimBehavior is efficient and suitable for malware detection in PCS. The experimental results show that SimBehavior can extract behavioural signatures effectively which can be used to detect new malware samples in PCS efficiently. Security and privacy protection have been the primary concerns in pushing towards the success of wireless mesh networks. In order to defend against the internal attacks and to achieve better security and privacy protection, Lin et al. propose a role based privacy-aware secure routing protocol (RPASRP), combining a new dynamic reputation mechanism with the role based multi-level security technology and a hierarchical key management protocol. Simulation results show that the proposed RPASRP implements the security and privacy

Security Assessment for Key Management in Mobile Ad Hoc Networks

A mobile ad hoc network (MANET) is a kind of wireless communication system that doesn't have base stations or routers. The wireless connections can be a standard Wi-Fi connection or satellite, or another medium such as a cellular transmission. Specific applications like military or public emergency require secure group communication in ad hoc environments. Good Key management is very important to get protection in any communication system. This paper presents most problems of securing key management in ad hoc networks. It presents a survey of different types of key management protocols in wired networks and in ad hoc networks. It presents the most common kinds of attacks in ad hoc networks. A new efficient approach is proposed. It is based on dividing the members into clusters. This scheme assumes a maximum allowed number of members in each cluster. This reduces the required number of encryption and decryption operations for each join operation in the cluster. This is most suitable for Mobile Ad hoc Networks.

DynTunKey: a dynamic distributed group key tunneling management protocol for heterogeneous wireless sensor networks

Wireless sensor networks (WSNs) are being used for many applications ranging from mobile target surveillance to intelligent home networking. Due to the sensitive nature of the data transmitted by these applications, appropriate protection mechanisms are needed to prevent attackers from exploiting the weaknesses of the radio links. In this paper, we propose a novel group key management scheme called DynTunKey (dynamic tunneling and group key management protocol). This paper investigates the use of secure tunnels as a solution to improve the protection of WSNs. We propose a tunneling scheme that conforms to the security requirements of WSNs while having less computational and network overhead. We also propose a solution for a dynamic integration in the secured communication of a newly deployed sensor. A set of experiments has been conducted to assess the performance of the proposed scheme with regard to recent key management protocol and to traditional tunnels built using the IPSec protocol. We found that our protocol considerably reduces the number of transmitted messages as well as the computational load, which makes it suitable for WSNs. We tested the proposed protocol considering two models of mobility of the targets which are respectively the Random Walk model and the Gauss Markov model.

A new Hierarchical Group Key Management based on Clustering Scheme for Mobile Ad Hoc Networks

The migration from wired network to wireless network has been a global trend in the past few decades because they provide anytime-anywhere networking services. The wireless networks are rapidly deployed in the future, secure wireless environment will be mandatory. As well, The mobility and scalability brought by wireless network made it possible in many applications. Among all the contemporary wireless networks,Mobile Ad hoc Networks (MANET) is one of the most important and unique applications. MANET is a collection of autonomous nodes or terminals which communicate with each other by forming a multihop radio network and maintaining connectivity in a decentralized manner. Due to the nature of unreliable wireless medium data transfer is a major problem in MANET and it lacks security and reliability of data. The most suitable solution to provide the expected level of security to these services is the provision of a key management protocol. A Key management is vital part of security. This issue is even bigger in wireless network compared to wired network. The distribution of keys in an authenticated manner is a difficult task in MANET. When a member leaves or joins the group, it needs to generate a new key to maintain forward and backward secrecy. In this paper, we propose a new group key management schemes namely a Hierarchical, Simple, Efficient and Scalable Group Key (HSESGK) based on clustering management scheme for MANETs and different other schemes are classified. Group members deduce the group key in a distributed manner.

Secure Collaborative Key Management for Dynamic Groups in Mobile Networks

Mobile networks are composed of heterogeneous mobile devices with peer-to-peer wireless communication. Their dynamic and self-organizing natures pose security challenge. We consider secure group key management for peer dynamic groups in mobile wireless networks. Many group based applications have achieved remarkable growth along with increasing use of multicast based services. The key sharing among the group members is an important issue for secure group communication because the communication for many participants implies that the likelihood of illegal overhearing increases. We propose a group key sharing scheme and efficient rekeying methods for frequent membership changes from network dynamics. The proposed method enables the group members to simply establish a group key and provide high flexibility for dynamic group changes such as member join or leave and group merging or partition. We conduct mathematical evaluation with other group key management protocols and finally prove its security by demonstrating group key secrecy, backward and forward secrecy, key independence, and implicit key authentication under the decisional Diffie-Hellman (DDH) assumption.

Group Key Management Protocols for Secure Mobile Multicast Communication: A Comprehensive Survey

Key management is equally important as compared to any other security measure such as encryption and authentication. With the growing usage of mobile devices and the advent of multicast communication, there has been a significant amount of work carried out in developing an optimum group key management protocol for mobile multicast systems. Key management is widely being adopted in securing group communication for both wired and wireless networks. Securing group communication over wired networks is fairly well established; however, wireless networks bring additional challenges due to member mobility and increase in the number of members. This paper presents a comprehensive survey of group key management protocols in wireless mobile environments that employ multicast communication. They are classified into network dependent and independent protocols and further categorized into tree-based and cluster-based key management protocols. The survey clearly outlines the characteristics of each protocol along with highlighting their advantages and limitations with respect to real-world systems. The paper is concluded with a taxonomy of the individual protocols with respect to the defined requirements which provides a strong source of literature reference for researchers in this field.

LTE-Advanced에서의 Machine Type Communications을 위한 그룹 기반 보안 프로토콜

사람이 개입할 필요 없이 기기 및 사물들을 셀룰러 망(cellular network)으로 연결하여 언제 어디서나 다양한 서비스를 제공하는 MTC(Machine Type Communications)는 차세대 통신의 주요 이슈로 고려되고 있다. 현재, 다수의 MTC 단말들이 동시적으로 망에 접속하려고 하면 각 MTC 단말들은 독립적인 접근 인증 절차를 수행해야 된다. 이로 인해 LTE-Advanced 네트워크에서 인증 시그널링(authentication signaling) 혼잡(congestion)과 부하(overload)의 문제가 야기된다. 본 논문은 그룹 기반의 인증 프로토콜과 키 관리 프로토콜을 제안한다. 그룹 단위로 MTC 단말들을 관리하기 위해 제안하는 프로토콜은 그룹 리더(leader)를 선출하고, 리더만이 코어 망(core network)과의 인증에 참여한다. 인증이 완료된 후, 그룹 리더는 이진트리(binary tree)를 구성하여 나머지 구성원(member)들과 MME(Mobility Management Entity)를 관리한다. 마지막으로 제안 프로토콜 분석은 제안하는 프로토콜이 MTC 단말들과 코어 망 사이에서 발생되는 인증 시그널링을 줄여줄 수 있을 뿐만 아니라 효율적으로 MTC 단말들을 관리할 수 있음도 보여준다. MTC(Machine Type Communications), providing a variety of services anytime and anywhere by connecting the cellular network to the machine and things without human intervention, is being considered as a major challenge of the next-generation communications. Currently, When a massive MTC devices simultaneously connect to the network, each MTC device needs an independent access authentication process. Because of this process, authentication signaling congestion and overload problems will cause in LTE-Advanced. In this paper, we propose a group-based authentication protocol and a key management protocol. For managing the MTC devices as group units, the proposed protocol elects a group leader and authentications only once with the core network. After the authentication is completed, a group leader manages the rest members and MME(Mobility Management Entity) by constructing a binary tree. Finally, the propose protocol analysis show that the proposed protocol not only can reduces the authentication signaling which generated in between the MTC devices and the core network but also can manages the MTC devices, efficiently.

Key distribution for heterogeneous public-key cryptosystems

The widespread use of cryptographic technologies is complicated by inconsistencies and duplication in the key management systems supporting their applications. The proliferation of key management systems or protocols also results in higher operational and infrastructure costs, and fails in interoperability. Thus, it is essential to realize key management interoperability between different and heterogeneous cryptosystems. This paper presents a practical and separable key management system for heterogeneous public-key cryptosystems. We achieve the interoperability between different cryptosystems via cryptography approaches rather than communication protocols. With our scheme, each client can freely use any kindof cryptosystem that it likes. The proposed scheme has two advantages over the key management interoperability protocol introduced by the organization for the advancement of structured information standards. One is that all the related operations do not involve the communication protocol and thus no special restrictions are taken on the client devices. The other is that the proposed scheme does not suffer from single-point fault and bottleneck problems.

Intra‐cluster key sharing in hierarchical sensor networks

In hierarchical sensor networks, key sharing at the intra-cluster tier (i.e. how to establish pairwise keys between a sensor and its cluster head) is more challenging than that at inter-cluster tier. Despite some key management protocols have been proposed, there still lacks both secure and efficient one. In this study, the authors proposed an intra-cluster key sharing to overcome the security problems nowadays. The analysis proved that this proposed scheme has the following advantages by comparing with other schemes: (i) it is more efficient in saving the storage overheads and communication overheads; (ii) it improves the resilience against node capture attacks during and after initialisation; and (iii) it guarantees 100% connectivity at intra-cluster communication tier.

Huddle hierarchy based group key management protocol using gray code

Secure and reliable group communication is an active area of research. Its popularity is fuelled by the growing importance of group-oriented and collaborative applications. The central research challenge is secure and efficient group key management. The present paper is based on the huddle hierarchy based secure multicast group key management scheme using the most popular absolute encoder output type code named gray code. The focus is of twofolds. The first fold deals with the reduction of computation complexity which is achieved in this protocol by performing fewer multiplication operations during the key updating process. To optimize the number of multiplication operations, the fast Fourier transform, divide and conquer approach for multiplication of polynomial representation of integers, is used in this proposed work. The second fold aims at reducing the amount of information stored in the Group Center and group members while performing the update operation in the key content. Comparative analysis to illustrate the performance of various key distribution protocols is shown in this paper and it has been observed that this proposed algorithm reduces the computation and storage complexity significantly.

Key management protocol with end-to-end data security and key revocation for a multi-BS wireless sensor network

Focusing on a large-scale wireless sensor network with multiple base stations (BS), a key management protocol is designed in this paper. For securely relaying data between a node and a base station or two nodes, an end-to-end data security method is adopted by this protocol. Further employing a distributed key revocation scheme to efficiently remove compromised nodes then forms our key management protocol celled multi-BS key management protocol (MKMP). Through performance evaluation, we show that MKMP outperforms LEDS Ren et al. (IEEE Trans Mobile Comput 7(5):585–598, 2008) in terms of efficiency of resilience against the node capture attack. With the analysis of key storage overheads, we demonstrate that MKMP performs better than mKeying Wang et al. (A key management protocol for wireless sensor networks with multiple base stations. In: Procceedings of ICC'08, pp 1625–1629, 2008) in terms of this overhead.

An Energy-Efficient Security Node-Based Key Management Protocol for WSN

A security node-based key management protocol is proposed for cluster-based sensor networks. Member nodes and cluster heads are responsible for data collection and transmission. Security nodes are responsible for key management. Security nodes restrain key management function of cluster heads, and reduce damage of captured cluster heads. Generation of security nodes and different kinds of keys is described. Performance analysis and simulation show that the proposed key management protocol consumes less energy, and its delay time of key generation is short. At the same time, the protocol can provide more collaborative authentication security for keys. It has strong resilience against node capture, and can support large scale network.

An Efficient Key Management Protocol for Multi-Microgrid Distribution System

This paper studies network security of the multi-microgrid distribution system (MMDS) composing of a large number of distributed power-islands. First, a hierarchical communication model for MMDS is designed . Then we analyze the security vulnerabilities. Finally, proposes an efficient secure key management protocol by combining Iolus framework and logical key hierarchy (LKH).

A Lightweight Key Management Protocol for Hierarchical Sensor Networks

Key Management is a fundamental security service in distributed sensor networks. The focus of this paper is to design a lightweight group key management scheme to safeguard the data packet passing on the sensor networks under different types of attacks. We propose an energy efficient level-based hierarchical system and build the secure route from the source node to sink node .We compromise between the energy consumption and the shortest path by utilizing the number of neighbors of a sensor when renewing a cluster head or choosing the next hop in the hierarchical clusters. In addition, our protocol contains group communication policies, group membership require-ments and an algorithm for generating a distributed group key for secure communication.

A novel batch-based group key management protocol applied to the Internet of Things

Many applications for ad hoc networks are based on a point-to-multipoint (multicast) communication paradigm, where a single source sends common data to many receivers, or, inversely, on a multipoint-to-point communication paradigm, where multiple sources send data to a single receiver. In such scenarios, communication can be secured by adopting a common secret key, denoted as “group key”, shared by multiple communication endpoints. In this work, we propose a novel centralized approach to efficiently distribute and manage a group key in generic ad hoc networks and Internet of Things, while reducing the computational overhead and network traffic due to group membership changes caused by users’ joins and leaves. In particular, the proposed protocol takes advantage of two possible leave strategies: (i) at a pre-determined time selected when the user joins the group or (ii) at an unpredictable time, as in the case of membership revocation. The proposed protocol is applied to two following relevant scenarios: (i) secure data aggregation in Internet of Things (IoT) and (ii) Vehicle-to-Vehicle (V2V) communications in Vehicular Ad hoc Networks (VANETs).