Group key management scheme for large-scale sensor networks

Eltoweissy, Mohamed; Wadaa, A.; Olariu, Stephan; Wilson, Larry

doi:10.1016/j.adhoc.2004.08.012

Cited by 50 publications

(31 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Recently, some work has been done in security of wireless sensor networks where sensors are anonymous [22,34]. Extending one of the random key pre-distribution schemes proposed in literature to this case can be an interesting research problem.…”

Section: Discussionmentioning

confidence: 99%

Energy efficient node-to-node authentication and communication confidentiality in wireless sensor networks

2006

View full text Add to dashboard Cite

A distributed Wireless Sensor Network (WSN) is a collection of low-end devices with wireless message exchange capabilities. Due to the scarcity of hardware resources, the lack of network infrastructures, and the threats to security, implementing secure pair-wise communications among any pair of sensors is a challenging problem in distributed WSNs. In particular, memory and energy consumption as well as resilience to sensor physical compromise are the most stringent requirements. In this paper, we introduce a new threat model to communications confidentiality in WSNs, the smart attacker model. Under this new, more realistic model, the security features of previously proposed schemes decrease drastically. We then describe a novel pseudo-random key pre-deployment strategy ESP that combines all the following properties: (a) it supports an energy-efficient key discovery phase requiring no communications; (b) it provides node to node authentication; (c) it is highly resistant to the smart attacker. We provide both asymptotic results and extensive simulations of the schemes that are being proposed

show abstract

Section: Discussionmentioning

confidence: 99%

Energy efficient node-to-node authentication and communication confidentiality in wireless sensor networks

2006

View full text Add to dashboard Cite

show abstract

“…In this way, the key distribution server can evict the compromised nodes from a communication group using only m messages. Eltoweissy et al also applied the EBS to the key management in Wireless Sensor Networks (WSNs) in [10]. Sensors first determine the cluster to which they belong through the location information broadcasted by the sink.…”

Section: Related Workmentioning

confidence: 99%

DIRECT: Dynamic Key Renewal Using Secure Cluster Head Election in Wireless Sensor Networks

Wang

Song²,

Cho

2010

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

SUMMARYIn modern sensor networks, key management is essential to transmit data from sensors to the sink securely. That is, sensors are likely to be compromised by attackers, and a key management scheme should renew the keys for communication as frequently as possible. In clustered sensor networks, CHs (Cluster Heads) tend to become targets of compromise attack because they collect data from sensors and deliver the aggregated data to the sink. However, existing key renewal schemes do not change the CH role nodes, and thus they are vulnerable to the compromise of CHs. Our scheme is called DIRECT (DynamIc key REnewal using Cluster head elecTion) because it materializes the dynamic key renewals through secure CH elections. In the scheme, the network is divided into sectors to separate CH elections in each sector from other sectors. Then, sensors establish pairwise keys with other sensors in their sector for intra-sector communication. Every CH election round, all sensors securely elect a CH in their sector by defeating the malicious actions of attackers. Therefore, the probability that a compromised node is elected as a CH decreases significantly. The simulation results show that our approach significantly improves the integrity of data, energy efficiency, and network longevity. key words: key management, cluster head election, wireless sensor networks, integrity, energy efficiency

show abstract

“…Exclusion Basis System (EBS) proposed a combinatorial clustering that attempts to minimize the number of rekeying messages while minimizing the number of keys stored by each sensor node [17,23,24]. In order to achieve this goal, EBS organizes nodes into overlapping groups that are, however, completely unrelated to the application needs [17].…”

Section: Related Workmentioning

confidence: 99%

“…In order to achieve this goal, EBS organizes nodes into overlapping groups that are, however, completely unrelated to the application needs [17]. Furthermore, two EBS-based rekeying schemes require the knowledge of the positions of sensor nodes [23,19]. Implementing a location service in WSNs, especially a secure one, is quite a difficult task [15].…”

Section: Related Workmentioning

confidence: 99%

LNT: A logical neighbor tree secure group communication scheme for wireless sensor networks

et al. 2012

View full text Add to dashboard Cite

a b s t r a c tSecure group communication is a paradigm that primarily designates one-to-many communication security. The proposed works relevant to secure group communication have predominantly considered the whole network as being a single group managed by a central powerful node capable of supporting heavy communication, computation and storage cost. However, a typical Wireless Sensor Network (WSN) may contain several groups, and each one is maintained by a sensor node (the group controller) with constrained resources. Moreover, the previously proposed schemes require a multicast routing support to deliver the rekeying messages. Nevertheless, multicast routing can incur heavy storage and communication overheads in the case of a wireless sensor network. Due to these two major limitations, we have reckoned it necessary to propose a new secure group communication with a lightweight rekeying process. Our proposal overcomes the two limitations mentioned above, and can be applied to a homogeneous WSN with resource-constrained nodes with no need for a multicast routing support. Actually, the analysis and simulation results have clearly demonstrated that our scheme outperforms the previous well-known solutions.

show abstract

Group key management scheme for large-scale sensor networks

Cited by 50 publications

References 14 publications

Energy efficient node-to-node authentication and communication confidentiality in wireless sensor networks

Energy efficient node-to-node authentication and communication confidentiality in wireless sensor networks

DIRECT: Dynamic Key Renewal Using Secure Cluster Head Election in Wireless Sensor Networks

LNT: A logical neighbor tree secure group communication scheme for wireless sensor networks

Contact Info

Product

Resources

About