Return
Quantum Data Aggregation Using Secret Sharing and Genetic Algorithm
DOI:10.1109/ACCESS.2020.3026238.png)
Abstract
En 中文
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
Keywords:
Teleportation
Data aggregation
Cryptography
Logic gates
Servers
Quantum entanglement
Wireless sensor networks
GA
QKD
quantum teleportation
quantum entanglement
simuaqron
QDA-SG
WSN
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.6
Papers:
9.7W
Citations:
29.4W

