Open Access

ARTICLE

SBOOSP for Massive Devices in 5G WSNs Using Conformable Chaotic Maps

Chandrashekhar Meshram^1,*, Agbotiname Lucky Imoize^2,3, Sajjad Shaukat Jamal⁴, Amer Aljaedi⁵, Adel R. Alharbi⁵

1 Department of Post Graduate Studies and Research in Mathematics, Jayawanti Haksar Government Post-Graduation College, College of Chhindwara University, Betul, 460001, M.P., India
2 Department of Electrical and Electronics Engineering, Faculty of Engineering, University of Lagos, Akoka, 100213, Lagos, Nigeria
3 Department of Electrical Engineering and Information Technology, Institute of Digital Communication, Ruhr University, 44801, Bochum, Germany
4 Department of Mathematics, College of Science, King Khalid University, Abha, Saudi Arabia
5 College of Computing and Information Technology, University of Tabuk, Tabuk 71491, Saudi Arabia

* Corresponding Author: Chandrashekhar Meshram. Email:

Computers, Materials & Continua 2022, 71(3), 4591-4608. https://doi.org/10.32604/cmc.2022.022642

Received 13 August 2021; Accepted 15 October 2021; Issue published 14 January 2022

Abstract

The commercialization of the fifth-generation (5G) wireless network has begun. Massive devices are being integrated into 5G-enabled wireless sensor networks (5G WSNs) to deliver a variety of valuable services to network users. However, there are rising fears that 5G WSNs will expose sensitive user data to new security vulnerabilities. For secure end-to-end communication, key agreement and user authentication have been proposed. However, when billions of massive devices are networked to collect and analyze complex user data, more stringent security approaches are required. Data integrity, non-repudiation, and authentication necessitate special-purpose subtree-based signature mechanisms that are pretty difficult to create in practice. To address this issue, this work provides an efficient, provably secure, lightweight subtree-based online/offline signature procedure (SBOOSP) and its aggregation (Agg-SBOOSP) for massive devices in 5G WSNs using conformable chaotic maps. The SBOOSP enables multi-time offline storage access while reducing processing time. As a result, the signer can utilize the pre-stored offline information in polynomial time. This feature distinguishes our presented SBOOSP from previous online/offline-signing procedures that only allow for one signature. Furthermore, the new procedure supports a secret key during the pre-registration process, but no secret key is necessary during the offline stage. The suggested SBOOSP is secure in the logic of unforgeability on the chosen message attack in the random oracle. Additionally, SBOOSP and Agg-SBOOSP had the lowest computing costs compared to other contending schemes. Overall, the suggested SBOOSP outperforms several preliminary security schemes in terms of performance and computational overhead.

---

Keywords

---