An Efficient Group Key Agreement Scheme in IoT

In complex Internet of Things (IoT) network, lightweight group key agreement is of great interest because of the limited device resources. However, it is difficult for most schemes to efficiently cope with frequent membership changes. In this paper, we integrate Shamir secret sharing and Elliptic Curve Cryptography (ECC), innovatively propose both a predistribution strategy and a subgroup reduction secret rule, and subsequently design a novel group key agreement scheme with high dynamics and high security. Comparative analysis has shown that the benefits of the programme are as follows: 1) it is more suitable for resource-constrained terminals in dynamic environments, where member joining has a computational complexity of only $O(t)$ ($\mathbf{t}$ is the threshold) and leaving only require $O(1); 2$) it has multiple security attributes, especially resistant to replay attacks and man-in-the-middle tampering; 3) the overall computational complexity of the programme is only $O(\mathrm{n})$ (n is the number of group users), it’s more efficient than related schemes.

Authors

Institutions

Publication Details

Published
2025-05-09
DOI
https://doi.org/10.1109/aemcse65292.2025.11042602
Primary Topic
Security in Wireless Sensor Networks
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An Efficient Group Key Agreement Scheme in IoT

Mengya Lei, Yan Wang, Ou Ruan, H. J. Yang
1 links
Security in Wireless Sensor Networks
article

An Efficient Group Key Agreement Scheme in IoT

Mengya Lei, Yan Wang, Ou Ruan, H. J. Yang
article en

Abstract

In complex Internet of Things (IoT) network, lightweight group key agreement is of great interest because of the limited device resources. However, it is difficult for most schemes to efficiently cope with frequent membership changes. In this paper, we integrate Shamir secret sharing and Elliptic Curve Cryptography (ECC), innovatively propose both a predistribution strategy and a subgroup reduction secret rule, and subsequently design a novel group key agreement scheme with high dynamics and high security. Comparative analysis has shown that the benefits of the programme are as follows: 1) it is more suitable for resource-constrained terminals in dynamic environments, where member joining has a computational complexity of only $O(t)$ ($\mathbf{t}$ is the threshold) and leaving only require $O(1); 2$) it has multiple security attributes, especially resistant to replay attacks and man-in-the-middle tampering; 3) the overall computational complexity of the programme is only $O(\mathrm{n})$ (n is the number of group users), it’s more efficient than related schemes.

Hubei University of Technology (CN)
Natural Science Foundation of Hubei Province
Openalex Percentile: Top 84%
Security in Wireless Sensor Networks
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.