Combinatorial Optimization of Group Key Management

Eltoweissy, Mohamed; Heydari, Mahdi; Morales, Linda; Sudborough, Ivan Hal

doi:10.1023/b:jons.0000015697.38671.ec

Cited by 133 publications

(93 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…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%

See 1 more Smart Citation

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

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].…”

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

show abstract

“…Eltoweissy et al proposed EBS to protect a group key from compromised nodes [12]. In an EBS, the key distribution server randomly picks k keys from k + m keys and distributes them to members.…”

Section: Related Workmentioning

confidence: 99%

“…Table 1 shows the parameters and their values employed in the simulations. In the EBS (Exclusion Basis System) [12] parameter, k + m refers to the size of key pool in a cluster and k refers to the size of the key ring in a member sensor. We compared DIRECT with a scheme which has no renewal mechanisms and a reactive key renewal scheme.…”

Section: Performance Evaluationmentioning

confidence: 99%

“…The schemes in the other category have reactive key renewal mechanisms. That is, they renew the keys revealed to compromised sensors whenever a compromised sensor (s) is detected [8]- [12]. In most of these schemes, the physical network is divided into some logical groups, which are called clusters, to distribute the key management load to each logical group.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

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

An authenticated group key distribution mechanism using theory of numbers

Liu

Harn

Chang

2013

Int J Communication

View full text Add to dashboard Cite

SUMMARY A group key distribution protocol can enable members of a group to share a secret group key and use it for secret communications. In 2010, Harn and Lin proposed an authenticated group key distribution protocol using polynomial‐based secret sharing scheme. Recently, Guo and Chang proposed a similar protocol based on the generalized Chinese remainder theorem. In this paper, we point out that there are some security problems of Guo and Chang's protocol and propose a simpler authenticated group key distribution protocol based on the Chinese remainder theorem. The confidentiality of our proposed protocol is unconditionally secure. Copyright © 2013 John Wiley & Sons, Ltd.

show abstract

Combinatorial Optimization of Group Key Management

Cited by 133 publications

References 8 publications

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

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

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

An authenticated group key distribution mechanism using theory of numbers

Contact Info

Product

Resources

About