Dynamic coefficient symmetric polynomial-based secure key management scheme for Internet of Things (IoT) networks
Background With the extensive application and continuous expansion of the Internet of Things (IoT), the access of a large number of resource-limited nodes makes the IoT application face a variety of security vulnerabilities and efficiency limitations, and the operating efficiency and security of IoT...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
PeerJ Inc.
2023-12-01
|
| Series: | PeerJ Computer Science |
| Subjects: | |
| Online Access: | https://peerj.com/articles/cs-1726.pdf |
| _version_ | 1827581312183042048 |
|---|---|
| author | Zhongya Liu Yunxiao Luo |
| author_facet | Zhongya Liu Yunxiao Luo |
| author_sort | Zhongya Liu |
| collection | DOAJ |
| description | Background With the extensive application and continuous expansion of the Internet of Things (IoT), the access of a large number of resource-limited nodes makes the IoT application face a variety of security vulnerabilities and efficiency limitations, and the operating efficiency and security of IoT are greatly challenged. Key management is the core element of network security and one of the most challenging security problems faced by wireless sensor networks. A suitable key management scheme can effectively defend against network security threats. However, among the key management schemes that have been proposed so far, most of them do not take into account the efficiency in terms of connectivity rate and resource overhead, and some of them even have security risks. Methods In this article, based on the symmetric polynomial algorithm, a dynamic coefficient symmetric polynomial key management scheme is proposed to better solve the IoT security problem. In this scheme, the nodes’ IDs are mapped into the elements of the shared matrix M by the identity mapping algorithm, and these elements are used to construct polynomials P(x,y) to generate pairwise keys. The communicating nodes have their own coefficients of P(x,y) and thus have higher connectivity. Results The overall performance evaluation shows that the scheme significantly improves the resilience against node capture and effectively reduces the communication and storage overheads compared to the previous schemes. Moreover, the scheme overcomes the λ-security of symmetric polynomial key management scheme, and is able to provide a large pool of polynomials for wireless sensor networks, facilitating large-scale application of nodes. |
| first_indexed | 2024-03-08T22:33:40Z |
| format | Article |
| id | doaj.art-be04077362844ababa48dceefc82f073 |
| institution | Directory Open Access Journal |
| issn | 2376-5992 |
| language | English |
| last_indexed | 2024-03-08T22:33:40Z |
| publishDate | 2023-12-01 |
| publisher | PeerJ Inc. |
| record_format | Article |
| series | PeerJ Computer Science |
| spelling | doaj.art-be04077362844ababa48dceefc82f0732023-12-17T15:05:11ZengPeerJ Inc.PeerJ Computer Science2376-59922023-12-019e172610.7717/peerj-cs.1726Dynamic coefficient symmetric polynomial-based secure key management scheme for Internet of Things (IoT) networksZhongya Liu0Yunxiao Luo1Chongqing University of Posts and Telecommunications, Chongqing, ChinaChongqing Technology and Business Institute, Chongqing, ChinaBackground With the extensive application and continuous expansion of the Internet of Things (IoT), the access of a large number of resource-limited nodes makes the IoT application face a variety of security vulnerabilities and efficiency limitations, and the operating efficiency and security of IoT are greatly challenged. Key management is the core element of network security and one of the most challenging security problems faced by wireless sensor networks. A suitable key management scheme can effectively defend against network security threats. However, among the key management schemes that have been proposed so far, most of them do not take into account the efficiency in terms of connectivity rate and resource overhead, and some of them even have security risks. Methods In this article, based on the symmetric polynomial algorithm, a dynamic coefficient symmetric polynomial key management scheme is proposed to better solve the IoT security problem. In this scheme, the nodes’ IDs are mapped into the elements of the shared matrix M by the identity mapping algorithm, and these elements are used to construct polynomials P(x,y) to generate pairwise keys. The communicating nodes have their own coefficients of P(x,y) and thus have higher connectivity. Results The overall performance evaluation shows that the scheme significantly improves the resilience against node capture and effectively reduces the communication and storage overheads compared to the previous schemes. Moreover, the scheme overcomes the λ-security of symmetric polynomial key management scheme, and is able to provide a large pool of polynomials for wireless sensor networks, facilitating large-scale application of nodes.https://peerj.com/articles/cs-1726.pdfIoTKey managementSecurityDynamic coefficientConnectivity rateResource overhead |
| spellingShingle | Zhongya Liu Yunxiao Luo Dynamic coefficient symmetric polynomial-based secure key management scheme for Internet of Things (IoT) networks PeerJ Computer Science IoT Key management Security Dynamic coefficient Connectivity rate Resource overhead |
| title | Dynamic coefficient symmetric polynomial-based secure key management scheme for Internet of Things (IoT) networks |
| title_full | Dynamic coefficient symmetric polynomial-based secure key management scheme for Internet of Things (IoT) networks |
| title_fullStr | Dynamic coefficient symmetric polynomial-based secure key management scheme for Internet of Things (IoT) networks |
| title_full_unstemmed | Dynamic coefficient symmetric polynomial-based secure key management scheme for Internet of Things (IoT) networks |
| title_short | Dynamic coefficient symmetric polynomial-based secure key management scheme for Internet of Things (IoT) networks |
| title_sort | dynamic coefficient symmetric polynomial based secure key management scheme for internet of things iot networks |
| topic | IoT Key management Security Dynamic coefficient Connectivity rate Resource overhead |
| url | https://peerj.com/articles/cs-1726.pdf |
| work_keys_str_mv | AT zhongyaliu dynamiccoefficientsymmetricpolynomialbasedsecurekeymanagementschemeforinternetofthingsiotnetworks AT yunxiaoluo dynamiccoefficientsymmetricpolynomialbasedsecurekeymanagementschemeforinternetofthingsiotnetworks |