Exponential Arithmetic Based Self-Healing Group Key Distribution Scheme with Backward Secrecy under the Resource-Constrained Wireless Networks

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.

Secure Information Sharing System for Online Patient Networks

“…Hybrid group key management schemes [29][30][31][32] are about the best use of both schemes: a centralized distribution scheme and a distributed key agreement scheme. Lastly, a self-healing group key distribution scheme (SGKD) is for wireless networks including sensor networks [33][34][35][36][37][38][39][40][41][42][43][44][45][46][47][48][49][50]. In this paper, we focus on SGKD schemes because SISS's application includes both networks of wired and wireless and SISS has more relations with SGKD schemes than other schemes.…”

“…The main point of self-healing schemes is that group members can recover the missing session keys without retransmission of the missing messages from the GM (group manager). A SGKD scheme is largely divided into four categories again: polynomial based SGKD (P-SGKD) schemes [33][34][35][36][37], vector space secret sharing based SGKD schemes [38][39][40][41], bilinear pairings based SGKD schemes [42,43], and exponential arithmetic based SGKD (E-SGKD) schemes [44][45][46][47][48][49][50][51]. P-SGKD and vector space secret sharing based SGKD schemes are generally known as "not efficient".…”

“…Scheme 3 in [48] and Scheme 2 in [49] are E-SGKD schemes transformed from revocation polynomial based P-SGKD schemes without hash chains. In [50], Gou et. al first proposed E-SGKD scheme with high efficiency and backward secrecy by combining dual chains: a traditional hash chain and a key chain.…”

“…(1 ≤ ≤ , ≥ , ̸ = ) cannot recover even knowing { , } and { 耠 , 耠 } [50], where is a group G at -th session.…”

A novel self‐healing key distribution scheme based on vector space access structure and MDS codes

“…So, a specialized group key distribution protocols, known as self-healing group key distribution protocols, have been proposed in the literature. [7][8][9][10][11][12][13][14][15] These are useful in several settings such as group keys needed to be used for a short period because of frequent changes in the group structure. 12,14,16 In these protocols, group lifetime is divided into epochs called sessions, 7,8,12,17 where each session has a unique group key.…”