In the process of data aggregation, intruder nodes and compromised nodes may decrease the system performance. Hence, security plays an important role. Secret sharing is a method to find the compromised nodes. The previous researches in secure data aggregation concentrated on key authentication process and little research is done in N-party secret sharing methods. In this article, we proposed quantum data aggregation using secret sharing and genetic algorithm, where a node forwards data to its most trusted neighbor only. In the proposed method, a node selects n 1-hop neighbors from a list of its m 1-hop neighbors, which well behaved over a period and forwards data to the most trusted amongst them. We simulated quantum teleportation using SimulaQron tool for establishing secure communication. However secured is the communication channel the compromised nodes may decrease the system performance by exposing network to malicious activities. Each node creates n shares of a secret and forwards a share on a secured quantum channel to the n 1-hop neighbors in such a way that from any t neighbors share(t<; n) the secret is reconstructed. The data aggregation security increases since a group of t users can reconstruct the key but no single user has the complete authority on the secret. The proposed method ensures that each node will be able to aggregate the captured message securely without any interventions from the compromised/intruder nodes. The proposed system applies genetic method to improve the efficiency of the process of detection of the compromised nodes based on the behavioral history of the node. While detecting the malicious nodes the proposed method accuracy rate is 98.8 and false rate is 0.15, which is almost equal to secure and energy-efficient data aggregation method based on an access control method. However, in terms of the size of the network considered, the percentage of malicious nodes assumed and from the basic principles of quantum teleportation, the proposed method proves to be a better protocol for implementing secure data aggregation.
In the process of data aggregation, intruder nodes and compromised nodes may decrease the system performance. Hence, security plays an important role. Secret sharing is a method to find the compromised nodes. The previous researches in secure data aggregation concentrated on key authentication process and little research is done in N-party secret sharing methods. In this article, we proposed quantum data aggregation using secret sharing and genetic algorithm, where a node forwards data to its most trusted neighbor only. In the proposed method, a node selects n 1-hop neighbors from a list of its m 1-hop neighbors, which well behaved over a period and forwards data to the most trusted amongst them. We simulated quantum teleportation using SimulaQron tool for establishing secure communication. However secured is the communication channel the compromised nodes may decrease the system performance by exposing network to malicious activities. Each node creates n shares of a secret and forwards a share on a secured quantum channel to the n 1-hop neighbors in such a way that from any t neighbors share(t<; n) the secret is reconstructed. The data aggregation security increases since a group of t users can reconstruct the key but no single user has the complete authority on the secret. The proposed method ensures that each node will be able to aggregate the captured message securely without any interventions from the compromised/intruder nodes. The proposed system applies genetic method to improve the efficiency of the process of detection of the compromised nodes based on the behavioral history of the node. While detecting the malicious nodes the proposed method accuracy rate is 98.8 and false rate is 0.15, which is almost equal to secure and energy-efficient data aggregation method based on an access control method. However, in terms of the size of the network considered, the percentage of malicious nodes assumed and from the basic principles of quantum teleportation, the proposed method proves to be a better protocol for implementing secure data aggregation.
Quantum Entanglement and Quantum swapping are major research areas nowadays.Remote quantum entanglement is used in many applications like secure communication, secret sharing, data aggregation, and precision sensing.In data aggregation applications, every sensor node captures data and communicates to the central node.Efficient Data aggregation depends on whether the local information or global quantum network information is used for constructing the aggregation schedules.In addition, Quantum networks suffer from lossy optical links and with limited resources such as quantum memories, edge capacities.Computation of optimal schedules deals with large quantities of data and complex time-consuming calculations.However, the quantum memories cannot hold the qubits for a longer time as the stored qubit completely decoheres an infinite amount of time.Hence, there is a necessity for finding new data aggregation scheduling protocols, which use optimal channel capacity and optimal size of memory for improving the network throughput.This paper uses a reinforcement-learning technique that considers entanglement pairing and swapping the success probability of nodes with their neighbors while finding an optimal scheduling policy.The proposed method uses local network information for constructing optimal data aggregation schedules by prior sharing the maximally entangled qubit pairs between the nodes through optimal usage of the processes, channel capacity, and memory at the intermediate nodes.Experiments show that our proposed method can maximize the network throughput.
Abstract Secure key distribution is crucial for maintaining communication confidentiality in networks with multiple communicating partners. Asymmetric key algorithms are vulnerable to quantum attacks because of the computational advantage offered by quantum computers, whereas symmetric key algorithms with sufficiently large keys remain comparatively more resistant. Quantum Key Distribution (QKD) has emerged as a promising quantum-secure key distribution technique based on the principles of quantum physics. However, practical QKD networks often rely on relay nodes to extend communication distance, and malicious relay nodes can compromise quantum keys during the relaying process. This study proposes a secure key relaying approach based on Shamir's Secret Sharing to mitigate this vulnerability. The proposed method uses a probabilistic behavioural model to assess relay nodes according to their curiosity and collaboration tendencies. By splitting a quantum key into multiple shares and routing them through paths with minimum compromise risk, the approach reduces exposure to malicious or colluding relay nodes. The proposed algorithm assigns risk to network paths by evaluating node-level curiosity and collaboration potential, determines the appropriate number of shares, and selects secure routing paths to minimise key compromise. The study further analyses the parameters influencing the ideal number of shares for a given network, thereby offering a resilient mechanism for quantum-safe communication in QKD networks with malicious relay nodes.
Secured Data Aggregation Scheduling in Ubiquitous sensor networks is a major research problem
nowadays. Since the sensors communicate wirelessly, they are exposed to a high level of vulnerability from
the intruders. Quantum key distribution is a technique that is used nowadays for providing security. Though
the secure keys are used for short distances only, it offers many advantages over traditional methods in
providing security. Quantum key distribution adopts many methods like entanglement swapping and quantum
teleportation. Reversible logic gates like CNOT, Toffoli, and Fredkin are proved to offer many advantages
in quantum computing. Also a very little research is carried to provide security to the nodes in ubiquitous
sensor networks using quantum cryptography so as to maximize the throughput and utilize the hardware
resources effectively. Hence in this paper, we propose an intrusion detection policy for security to sensor
nodes using quantum cryptography. The proposed protocol monitors the communication between sensor
nodes and uses a simple policy to detect the malicious nodes. In our detection policy we adopted an
EPR-pair allocation scheme in terms of the quantum gates like Toffoli and Feynman called SwapGate.
In the wireless sensor networks (WSNs), sensor nodes may be deployed in the hostile areas. The eavesdropper can intercept the messages in the public channel and the communication between the nodes is easily monitored. Furthermore, any malicious intermediate node can act as a legal receiver to alter the passing messages. Hence, message protection and sensor node identification become important issues in WSN. In this paper, we propose a novel scheme providing unconditional secure communication based on the quantum characteristics, including no-cloning and teleportation. We present a random EPR-pair allocation scheme that is designed to overcome the vulnerability caused by possible compromised nodes. EPR pairs are pre-assigned to sensor nodes randomly and the entangled qubits are used by the nodes with the quantum teleportation scheme to form a secure link. We also show a scheme on how to resist the man-in-the-middle attack. In the framework, the qubits are allocated to each node before deployment and the adversary is unable to create the duplicated nodes. Even if the malicious nodes are added to the network to falsify the messages transmitting in the public channel, the legal nodes can easily detect the fake nodes that have no entangled qubits and verify the counterfeit messages. In addition, we prove that one node sharing EPR pairs with a certain amount of neighbor nodes can teleport information to any node in the sensor network if there are sufficient EPR pairs in the qubits pool. The proposal shows that the distributed quantum wireless sensor network gains better security than classical wireless sensor network and centralized quantum wireless network.
Nowadays, succeeding safe communication and protection-sensitive data from unauthorized access above public networks are the main worries in cloud servers. Hence, to secure both data and keys ensuring secured data storage and access, our proposed work designs a Novel Quantum Key Distribution (QKD) relying upon a non-commutative encryption framework. It makes use of a Novel Quantum Key Distribution approach, which guarantees high level secured data transmission. Along with this, a shared secret is generated using Diffie Hellman (DH) to certify secured key generation at reduced time complexity. Moreover, a non-commutative approach is used, which effectively allows the users to store and access the encrypted data into the cloud server. Also, to prevent data loss or corruption caused by the insiders in the cloud, Optimized Genetic Algorithm (OGA) is utilized, which effectively recovers the data and retrieve it if the missed data without loss. It is then followed with the decryption process as if requested by the user. Thus our proposed framework ensures authentication and paves way for secure data access, with enhanced performance and reduced complexities experienced with the prior works.
Quantum communication ensures that data remains secure from unauthorized access. Despite these advantages, this technology faces several challenges. For instance, photons can be lost when they go through channels, and there is a chance of eavesdropping, that make the system not as trustworthy, safe, and efficient. To make quantum communication systems function effectively in the real world, we need to combine advanced technologies like quantum error correction mechanisms and quantum repeaters. This work suggests a unified Quantum Inspired Genetic Algorithm (QIGA) framework that utilizes collaborative quantum repeaters to conquer the limitations of network links over distance. This study introduces a hybrid optimization topology (OT) that integrates mesh, star, and ring configurations for measurement device-independent quantum key distribution (MDI-QKD) networks. This approach allows for the efficient use of resources for scalable quantum communication networks. The proposed network architecture integrates 12 user nodes, a trusted node, and a single shared quantum repeater within a hybrid topology. The repeater deployment has been designed to support links that are longer than 52 km. This design accommodates deployments on various scales, small, medium, and large, while optimizing resource usage and infrastructure costs. We evaluated the performance and security trade offs in quantum communication networks by optimizing three topologies with a QIGA: ring, ring-star, and ring-star-mesh hybrid (QIGA−OT). The optimization methodology aims to reconcile essential performance metrics, such as the Secure Key Rate (SKR), Quantum Bit Error Rate (QBER), channel loss, and Merit of Quantum Efficiency (MQE). MQE functions as a metric for evaluating trades concerning security, efficiency, and cost-effectiveness within the network. This work presents a novel approach for utilizing quantum-inspired in the effective design and implementation of scalable network topologies across numerous fields of application.