Efficient and Secure Group Key Management Scheme Based on Factorial Trees for Dynamic IoT Settings
The Internet of Things (IoT) extends Internet connectivity to resource-constrained devices such as sensors and actuators. It is prone to several security threats and attacks, due to which defence mechanisms such as encryption, message authentication codes, authentication, etc., need to be employed....
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2024-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/10382513/ |
_version_ | 1797357101778993152 |
---|---|
author | K. Sudheeradh N. Neha Jahnavi Pramod N. Chine Gaurav S. Kasbekar |
author_facet | K. Sudheeradh N. Neha Jahnavi Pramod N. Chine Gaurav S. Kasbekar |
author_sort | K. Sudheeradh |
collection | DOAJ |
description | The Internet of Things (IoT) extends Internet connectivity to resource-constrained devices such as sensors and actuators. It is prone to several security threats and attacks, due to which defence mechanisms such as encryption, message authentication codes, authentication, etc., need to be employed. Several IoT scenarios require secure communication to and data acquisition from multiple devices, which constitute a “group”. Also, in dynamic IoT scenarios, devices join or leave a group from time to time, due to which the group keys, which are used for multicasting information within the group, need to be efficiently updated. We propose a novel scheme, based on factorial trees and the Chinese Remainder Theorem, for efficient Group Key Management. Our proposed scheme prevents malicious users from accessing information from a group and efficiently updates the group keys when devices join or leave a group, while guaranteeing forward and backward secrecy. We evaluate the performance of the proposed scheme via extensive mathematical analysis and numerical computations, and show that it outperforms schemes proposed in prior work in terms of the communication and computation costs incurred by IoT devices. |
first_indexed | 2024-03-08T14:39:56Z |
format | Article |
id | doaj.art-a43cdac311864e07bf59a8a8dd89dba2 |
institution | Directory Open Access Journal |
issn | 2169-3536 |
language | English |
last_indexed | 2024-03-08T14:39:56Z |
publishDate | 2024-01-01 |
publisher | IEEE |
record_format | Article |
series | IEEE Access |
spelling | doaj.art-a43cdac311864e07bf59a8a8dd89dba22024-01-12T00:02:04ZengIEEEIEEE Access2169-35362024-01-01125659567110.1109/ACCESS.2024.335078010382513Efficient and Secure Group Key Management Scheme Based on Factorial Trees for Dynamic IoT SettingsK. Sudheeradh0N. Neha Jahnavi1Pramod N. Chine2Gaurav S. Kasbekar3https://orcid.org/0000-0002-9381-2803Department of Electrical Engineering, Indian Institute of Technology Bombay, Mumbai, IndiaDepartment of Electrical Engineering, Indian Institute of Technology Bombay, Mumbai, IndiaDepartment of Electrical Engineering, Indian Institute of Technology Bombay, Mumbai, IndiaDepartment of Electrical Engineering, Indian Institute of Technology Bombay, Mumbai, IndiaThe Internet of Things (IoT) extends Internet connectivity to resource-constrained devices such as sensors and actuators. It is prone to several security threats and attacks, due to which defence mechanisms such as encryption, message authentication codes, authentication, etc., need to be employed. Several IoT scenarios require secure communication to and data acquisition from multiple devices, which constitute a “group”. Also, in dynamic IoT scenarios, devices join or leave a group from time to time, due to which the group keys, which are used for multicasting information within the group, need to be efficiently updated. We propose a novel scheme, based on factorial trees and the Chinese Remainder Theorem, for efficient Group Key Management. Our proposed scheme prevents malicious users from accessing information from a group and efficiently updates the group keys when devices join or leave a group, while guaranteeing forward and backward secrecy. We evaluate the performance of the proposed scheme via extensive mathematical analysis and numerical computations, and show that it outperforms schemes proposed in prior work in terms of the communication and computation costs incurred by IoT devices.https://ieeexplore.ieee.org/document/10382513/AuthenticationChinese remainder theoremfactorial treegroup key managementInternet of Things (IoT)key distribution center |
spellingShingle | K. Sudheeradh N. Neha Jahnavi Pramod N. Chine Gaurav S. Kasbekar Efficient and Secure Group Key Management Scheme Based on Factorial Trees for Dynamic IoT Settings IEEE Access Authentication Chinese remainder theorem factorial tree group key management Internet of Things (IoT) key distribution center |
title | Efficient and Secure Group Key Management Scheme Based on Factorial Trees for Dynamic IoT Settings |
title_full | Efficient and Secure Group Key Management Scheme Based on Factorial Trees for Dynamic IoT Settings |
title_fullStr | Efficient and Secure Group Key Management Scheme Based on Factorial Trees for Dynamic IoT Settings |
title_full_unstemmed | Efficient and Secure Group Key Management Scheme Based on Factorial Trees for Dynamic IoT Settings |
title_short | Efficient and Secure Group Key Management Scheme Based on Factorial Trees for Dynamic IoT Settings |
title_sort | efficient and secure group key management scheme based on factorial trees for dynamic iot settings |
topic | Authentication Chinese remainder theorem factorial tree group key management Internet of Things (IoT) key distribution center |
url | https://ieeexplore.ieee.org/document/10382513/ |
work_keys_str_mv | AT ksudheeradh efficientandsecuregroupkeymanagementschemebasedonfactorialtreesfordynamiciotsettings AT nnehajahnavi efficientandsecuregroupkeymanagementschemebasedonfactorialtreesfordynamiciotsettings AT pramodnchine efficientandsecuregroupkeymanagementschemebasedonfactorialtreesfordynamiciotsettings AT gauravskasbekar efficientandsecuregroupkeymanagementschemebasedonfactorialtreesfordynamiciotsettings |