TY - GEN
T1 - Lightweight Group Key Establishment for Reducing Memory Overhead
AU - Agustini, Siti
AU - Wirawan,
AU - Hendrantoro, Gamantyo
N1 - Publisher Copyright:
© 2023 Global IT Research Institute (GiRI).
PY - 2023
Y1 - 2023
N2 - Wireless Sensor Network (WSN) and Internet of Things (IoT) allow sensor devices to collect information about various critical sectors through wireless networks. However, when the WSNs are connected to a public network, the security of the WSN is vulnerable. Besides, WSN needs a key distribution scheme to secure data among other sensor devices. Furthermore, IoT devices have low computing, energy, and memory storage capabilities. Thus, designing a lightweight, efficient, and secure protocol communication for WSN is always a challenge due to the resource constraint of sensor devices. The existing schemes result in the number of keys stored by sensor devices depending on group size. When the group size increases, the number of the stored key by the sensor also increases. Other research proposes key establishment based on polynomial multiplicative and causes high computational capability. This paper proposed a key distribution scheme based on (p, q)-Lucas polynomial and XOR to achieve lightweight, memory overhead efficiency and security. The proposed method is evaluated in several parameters: memory overhead, communication overhead, energy consumption, computational complexity analysis, and security. The results indicate that our scheme outperforms the existing approaches regarding memory overhead, computation efficiency, and support security.
AB - Wireless Sensor Network (WSN) and Internet of Things (IoT) allow sensor devices to collect information about various critical sectors through wireless networks. However, when the WSNs are connected to a public network, the security of the WSN is vulnerable. Besides, WSN needs a key distribution scheme to secure data among other sensor devices. Furthermore, IoT devices have low computing, energy, and memory storage capabilities. Thus, designing a lightweight, efficient, and secure protocol communication for WSN is always a challenge due to the resource constraint of sensor devices. The existing schemes result in the number of keys stored by sensor devices depending on group size. When the group size increases, the number of the stored key by the sensor also increases. Other research proposes key establishment based on polynomial multiplicative and causes high computational capability. This paper proposed a key distribution scheme based on (p, q)-Lucas polynomial and XOR to achieve lightweight, memory overhead efficiency and security. The proposed method is evaluated in several parameters: memory overhead, communication overhead, energy consumption, computational complexity analysis, and security. The results indicate that our scheme outperforms the existing approaches regarding memory overhead, computation efficiency, and support security.
KW - Group key establishment
KW - Lucas polynomial
KW - WSN
KW - information security
KW - key distribution
KW - memory overhead
UR - http://www.scopus.com/inward/record.url?scp=85152188600&partnerID=8YFLogxK
U2 - 10.23919/ICACT56868.2023.10079388
DO - 10.23919/ICACT56868.2023.10079388
M3 - Conference contribution
AN - SCOPUS:85152188600
T3 - International Conference on Advanced Communication Technology, ICACT
SP - 195
EP - 200
BT - 25th International Conference on Advanced Communications Technology
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 25th International Conference on Advanced Communications Technology, ICACT 2023
Y2 - 19 February 2023 through 22 February 2023
ER -