Dynamic Key Management Scheme Research Articles

A Location-aware and Secret-share Based Dynamic Key Management Scheme for Heterogeneous Sensor Networks

Recently, Numerous dynamic key management schemes have been proposed for WSN, and it has long-lived networks , more sustained security and survivability, such as SH E LL and LCOK. But most of these schemes are greatly depend on some central nodes (gateways), if these nodes were compromised , there will be great threat to the whole networks security and survivability. In this paper, we proposed a Location-aware and secret share based dynamic key management scheme to effectively replace the compromised central node and enhance the security level of the network.

Collusion Problem of the EBS-Based Dynamic Key Management Scheme

The security of wireless sensor networks has attracted much attention in recent years and the key management is the focus.EBS-based dynamic key management scheme is a new approach for wireless sensor networks.Its major advantages are its enhanced network survivability,high dynamic performance and better support for network expansion.But it suffers from the collusion problem,which means it is prone to the cooperative attack of the compromised nodes.In this paper,the feature of the collusion problem is analyzed and an optimization model is proposed,maximizing the length of the shortest collusion chain,which is the key issue of the problem.A discrete particle swarm optimization algorithm for the collusion problem is also presented based on the optimization model proposed.Simulation results show that compared with the former works,the resilience of the network and the difficulty to compromise the whole network are both greatly improved.

Dynamic combinatorial key management scheme for sensor networks

AbstractSecuring sensor networks has received much attention in the last few years. In a typical field deployment, a sensor network self‐organizes, closely interacts with its physical environment, and works unattended possibly in a hostile environment such as a battlefield. In such environments, sensor networks are subject to node capture as well as a myriad of other attacks. Constrained energy, memory, and computational capabilities of sensor nodes mandate a clever design of security solutions to minimize overhead while maintaining secure communications over the lifespan of the network. In this paper, we propose a Dynamic Combinatorial Key management scheme, DCK, to provide efficient, scalable, and survivable dynamic keying in a clustered sensor network with a large number of sensor nodes. DCK employs the Exclusion‐Basis Systems (EBS) as the underlying framework for key management at both the cluster and the sensor node levels. DCK enhances network security by localizing cluster key management functions, thus, limiting the impact of sensor node capture to the attacked cluster. Within a cluster, DCK decouples key generation, assignment, and distribution, and distributes the key management tasks among cluster nodes. Simulation results show that DCK is efficient in terms of energy consumption and storage. Also, it significantly outperforms other dynamic keying schemes, in particular with regards to energy consumed in key refreshment and re‐keying after node capture. Copyright © 2006 John Wiley & Sons, Ltd.

Dynamic key management in sensor networks

Numerous key management schemes have been proposed for sensor networks. The objective of key management is to dynamically establish and maintain secure channels among communicating nodes. Desired features of key management in sensor networks include energy awareness, localized impact of attacks, and scaling to a large number of nodes. A primary challenge is managing the trade-off between providing acceptable levels of security and conserving scarce resources, in particular energy, needed for network operations. Many schemes, referred to as static schemes, have adopted the principle of key predistribution with the underlying assumption of a relatively static short-lived network (node replenishments are rare, and keys outlive the network). An emerging class of schemes, dynamic key management schemes, assumes long-lived networks with more frequent addition of new nodes, thus requiring network rekeying for sustained security and survivability. In this article we present a classification of key management schemes in sensor networks delineating their similarities and differences. We also describe a novel dynamic key management scheme, localized combinatorial keying (LOCK), and compare its security and performance with a representative static key management scheme. Finally, we outline future research directions.

A practical and dynamic key management scheme for a user hierarchy

In this paper, we proposed a practical and dynamic key management scheme based on the Rabin public key system and a set of matrices with canonical matrix multiplication to solve the access control problem in an arbitrary partially ordered user hierarchy. The advantage is in ensuring that the security class in the higher level can derive any of its successor’s secret keys directly and efficiently and show it is dynamic while a new security class is added into or a class is removed from the hierarchy. Even the ex-member problem can be solved efficiently. Moreover, any user can freely change its own key for some security reasons.

An efficient hierarchical key management scheme based on elliptic curves

Lin [1] proposed a dynamic key management scheme suitable for hierarchical control systems and that appeared in Computer Communications. It is useful in solving the key management problem for a privileged hierarchy using related parameters. However, the related parameters are generated by modulo exponential computation. This seems not efficient enough for a system with frequently changing requirements. Besides, Lee and Hwang proposed two comments to this scheme [2]. To eliminate the possible drawbacks as discussed in their comments, Cho [3] proposed modifying the scheme by adding a parameter. Although Cho’s scheme is an improvement in security, it is not as efficient as Lin’s scheme. In this paper. we propose a novel scheme. based on the elliptic curves that eliminates the drawbacks and has better performance.

Comments on `dynamic key management schemes for access control in a hierarchy'

In 1997, Lin proposed a new dynamic access control scheme with a central authority for users organized in a hierarchy. The author claimed that the new scheme has many advantages, e.g. any class can change its group key for security reasons without affecting the others. However, this paper will show that once the old group key of a class is exposed, the newly chosen group key can be easily derived by the old key. Moreover, we shall show that if the identity of a class has a few bits different from those of the other classes, a user in the class can easily derive the group keys of these classes to which he/she is not entitled.

Dynamic key management schemes for access control in a hierarchy

Secure access control in user hierarchy is designed such that users are authorized and classified into different privilege classes. A user belonging to a higher-privileged class will have access rights to messages created or owned by users in a lower-privileged class; while the opposite is not allowed. Methods for generating cryptographic keys to security classes can be categorized as the key assignment approach and the key management approach. In this paper, we shall propose a new hierarchical access control mechanism which possesses the advantages of the two approaches. Dynamic operations, such as class insertions or class deletions and key changes, etc., can be fulfilled efficiently. Besides, it is easy for an ancestor to deduce the key of his descendants which is positioned in a far-lower-privileged class.