A provably secure sharding based blockchain smart contract centric hierarchical group key agreement for large wireless ad‐hoc networks

Abstract

Group key management with privacy preserving and trust still remains a precarious and stimulating issue for securing multicast communications in an energy embarrassed large wireless ad-hoc networks (WANETs). To address this, few researchers with the adaption of blockchain technology and practical usage of a privacy-preserving smart contract as group controller made these group key agreements adaptable to WANET. However, proportionate to the increase in the size of the group, the processing load on the smart contract is also increasing, which made the capability of the smart contract could not work beyond a certain group size. Contemporary blockchain schemes suffer from various inherent shortcomings in their latency, scalability, and processing throughput. So, in this direction, we adopted blockchain sharding smart contract-centric processing for making the key agreement adaptable to large WANETs.In this technique, we divide the large network into r sharded subnetworks with G 1 , G 2 , G 3 , … , G r as smart contract instances generated by group controller G, which acts as subgroup controllers to their respective shards using blockchain sharding technique. This protocol is shown secure under the assumptions elliptic curve decision Diffie-Hellman and group-elliptic curve Diffie-Hellman. The performance analysis demonstrates that the proposed protocol is highly proficient than examined protocols for secure communication in large WANETs.

An Authenticated Group Shared Key Mechanism Based on a Combiner for Hash Functions over the Industrial Internet of Things

“…For intelligent Internet of Things (IoT) systems, Zhang et al [19] created the GKA protocol, which enabled a rational terminal to form a group key with a threshold requirement. Sharding and blockchain technologies were integrated into GKA by Naresh et al [20] to reduce the computational and communication costs of the group controller. The group has been distributed into the r subgroup, which was used to generate the hierarchical group keys.…”

“…The previous literature studies [10][11][12][13][14][15][16][17][18][19][20][21][22][23][24][25][26] had several limitations, which can be specified in three facts: Firstly, the group key agreements that were reviewed in the related works were required to broadcast and exchange many messages between the controller and the group members, which might have exposed the group shared key (GSK) and increased the communication and computation costs. Second, some protocols did not consider the group member authentication and message integrity, thereby facilitating the MITM attack.…”

Approaches to Overpower Proof-of-Work Blockchains Despite Minority

“…Additionally, the utilized DSs represent ID pointers to miners, which raises concerns regarding linkage attacks possibility in public BCs. Yes q ≤ 1/4 Yes Randomized Ostraka [86] Yes N/A No Randomized SBSCH-GKA [89] Yes N/A Yes N/A Cycledger [90] Yes f ≤ N/3 Yes Randomized RepChain [91] Yes f ≤ N/3 Yes Randomized SSHC [92] Yes q ≤ 1/3 Yes Randomized RapidChain [93] No…”

Enabling security in MANETs using an efficient cluster based group key management with elliptical curve cryptography in consort with sail fish optimization algorithm

“…When variations occur, the adjacent node begins the rekeying action hence decreasing the load on the cluster head. The group head selects a random key to be used for encrypting the swapped among the cluster heads and the network head sends the key to the group head that is used for communication among the cluster head 18,19 …”

“…The group head selects a random key to be used for encrypting the swapped among the cluster heads and the network head sends the key to the group head that is used for communication among the cluster head. 18,19 Group key agreement is better than key distribution for secure communication: Key distribution: Peer group communication is better suited for distributed group key management, particularly unreliable networks. It entails choosing a group member dynamically who serves as a key distribution server.…”