A Novel QKD Approach to Enhance IIOT Privacy and Computational Knacks

Abstract

The industry-based internet of things (IIoT) describes how IIoT devices enhance and extend their capabilities for production amenities, security, and efficacy. IIoT establishes an enterprise-to-enterprise setup that means industries have several factories and manufacturing units that are dependent on other sectors for their services and products. In this context, individual industries need to share their information with other external sectors in a shared environment which may not be secure. The capability to examine and inspect such large-scale information and perform analytical protection over the large volumes of personal and organizational information demands authentication and confidentiality so that the total data are not endangered after illegal access by hackers and other unauthorized persons. In parallel, these large volumes of confidential industrial data need to be processed within reasonable time for effective deliverables. Currently, there are many mathematical-based symmetric and asymmetric key cryptographic approaches and identity- and attribute-based public key cryptographic approaches that exist to address the abovementioned concerns and limitations such as computational overheads and taking more time for crucial generation as part of the encipherment and decipherment process for large-scale data privacy and security. In addition, the required key for the encipherment and decipherment process may be generated by a third party which may be compromised and lead to man-in-the-middle attacks, brute force attacks, etc. In parallel, there are some other quantum key distribution approaches available to produce keys for the encipherment and decipherment process without the need for a third party. However, there are still some attacks such as photon number splitting attacks and faked state attacks that may be possible with these existing QKD approaches. The primary motivation of our work is to address and avoid such abovementioned existing problems with better and optimal computational overhead for key generation, encipherment, and the decipherment process compared to the existing conventional models. To overcome the existing problems, we proposed a novel dynamic quantum key distribution (QKD) algorithm for critical public infrastructure, which will secure all cyber–physical systems as part of IIoT. In this paper, we used novel multi-state qubit representation to support enhanced dynamic, chaotic quantum key generation with high efficiency and low computational overhead. Our proposed QKD algorithm can create a chaotic set of qubits that act as a part of session-wise dynamic keys used to encipher the IIoT-based large scales of information for secure communication and distribution of sensitive information.

Research on the network handoff strategy based on the best access point name decision

“…The performance of A4 was compared with Teng et al (2020) (abbreviated as A5), ( Yao et al, 2020 ) (abbreviated as A6), and ( Meng et al, 2022 ) (abbreviated as A7) according to the conditions of a network configuration and the performance parameter evaluation method of Experiment 1. More references can be found in Ahmad et al (2022) , Alrashed et al (2022) , and Singamaneni et al (2022) .…”

A Novel Multi-Qubit Quantum Key Distribution Ciphertext-Policy Attribute-Based Encryption Model to Improve Cloud Security for Consumers

“…In [26], a new Quantum Hash-focused Cypher Policy-Attribute-based Encryption (QH-CPABE) architecture was designed to protect cloud users' sensitive data, including structured and unstructured huge cloud clinical data. Simulations and experiments show that this proposal improves bit hash change accuracy and chaotic dynamic key production, encryption, and decryption times compared to conventional methods from previous studies, with slightly higher computational overhead [27]. A new cloud data security solution using quantum chaotic hash-based attribute-based encryption is proposed in [28].…”

Design of a low carbon economy model by carbon cycle optimization in supply chain

“…To optimize the relationship between each link in the model promotion model, this paper uses the SA-ACPSO method to optimize accordingly. The SA-ACPSO algorithm mentioned in this paper combines the simulated annealing operator and the mixed pure perturbation based on PSO and makes particles increase their randomness ergodicity through chaotic mapping, which can improve the ability of the algorithm itself to avoid local convergence, which is, improve the global convergence performance (Singamaneni et al, 2022). In order to better conform to and adapt to the characteristics of the multi-objective and multi-constraint of the economy scheduling problem, the inertia weight of particles will be adjusted before scheduling, which can enable the algorithm to expand the search scope at the initial stage.…”