Abstract
In resource-constrained wireless networks, resources such as storage space and communication bandwidth are limited. To guarantee secure communication in resource-constrained wireless networks, group keys should be distributed to users. The self-healing group key distribution (SGKD) scheme is a promising cryptographic tool, which can be used to distribute and update the group key for the secure group communication over unreliable wireless networks. Among all known SGKD schemes, exponential arithmetic based SGKD (E-SGKD) schemes reduce the storage overhead to constant, thus is suitable for the the resource-constrained wireless networks. In this paper, we provide a new mechanism to achieve E-SGKD schemes with backward secrecy. We first propose a basic E-SGKD scheme based on a known polynomial-based SGKD, where it has optimal storage overhead while having no backward secrecy. To obtain the backward secrecy and reduce the communication overhead, we introduce a novel approach for message broadcasting and self-healing. Compared with other E-SGKD schemes, our new E-SGKD scheme has the optimal storage overhead, high communication efficiency and satisfactory security. The simulation results in Zigbee-based networks show that the proposed scheme is suitable for the resource-restrained wireless networks. Finally, we show the application of our proposed scheme.
Highlights
Wireless sensor networks have drawn a lot of attention because they have demonstrated applicability in practical applications, such as emergency rescue operations and military application
We proposed two E-self-healing group key distribution (SGKD) schemes
The basic exponential arithmetic based SGKD (E-SGKD) scheme was constructed from a known polynomial-based SGKD, and it has offered the optimal storage overhead while not having backward secrecy
Summary
Wireless sensor networks have drawn a lot of attention because they have demonstrated applicability in practical applications, such as emergency rescue operations and military application. Simplified Staddon et al.’s scheme and proposed an E-SGKD scheme (see Scheme 4 [2]) based on univariate polynomial and Lagrange Interpolation with lower communication overhead Both construction 5 [1] and Scheme 4 [2] do not have backward secrecy and the size of the broadcast is. Compared with existing E-SGKD schemes [14,15] with backward secrecy, our proposed scheme has full self-healing properties, that is, user nodes can recover all of the lost session keys. Two chains are combined together to help the active group users compute the lost session keys, which reduces the number of the broadcast messages Note that these two strategies, especially the first one, can be applied to transform other P-SGKD schemes to E-SGKD schemes.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have