It seems impossible to endow opportunistic characteristic to quantum network on the basis that quantum channel cannot be overheard without disturbance. We propose an opportunistic quantum network coding scheme by taking full advantage of channel characteristic of quantum teleportation. On one hand, it utilizes quantum channel for the secure transmission of quantum states and can detect eavesdroppers by means of quantum channel verification. On the other hand, it utilizes classical channel for opportunistic listening and can acquire coding opportunity from neighbors. Analysis results show that our scheme can reduce the times of transmissions for relay nodes and can effectively defend against classical passive attack and quantum active attack.
It seems impossible to endow opportunistic characteristic to quantum network on the basis that quantum channel cannot be overheard without disturbance. We propose an opportunistic quantum network coding scheme by taking full advantage of channel characteristic of quantum teleportation. On one hand, it utilizes quantum channel for the secure transmission of quantum states and can detect eavesdroppers by means of quantum channel verification. On the other hand, it utilizes classical channel for opportunistic listening and can acquire coding opportunity from neighbors. Analysis results show that our scheme can reduce the times of transmissions for relay nodes and can effectively defend against classical passive attack and quantum active attack.
Quantum network coding is vulnerable to pollution attacks, especially when using classical channel as auxiliary resource. On this basis, this letter proposes a secure quantum network coding scheme against pollution attacks. The scheme uses quantum homomorphic signature for the efficient authentication of different data sources so as to detect pollution attacks in the butterfly network. Furthermore, with the help of trusted intermediate nodes, it can locate a corrupt data source. Analysis results show that the proposed quantum network coding scheme can defend against pollution attacks with high fidelity, fewer resource consumption, and lower rate region.
The intermediate communication nodes are allowed by network coding to encode the received data. Moreover, it has been confirmed that the upper limit of the communication network capacity can be achieved, which is conducive to improving the throughput of the communication network, but it is vulnerable to pollution attacks when the classic channels are used as the auxiliary resources. Although the quantum network coding can be used to increase the transmission speed of quantum bits per unit time based on the existing channels, the same security problems have arisen from quantum network coding in terms of the pollution attacks. In this paper, based on the anti-pollution characteristics of quantum signatures, a kind of quantum blind signature network coding scheme is put forward. Since various performances of the signature added in the process of data transmission will be improved, the blind signature is added at the intermediate node of the secure butterfly network and the data has been blinded by means of the quantum entanglement characteristics, yet the data of the intermediate node data packet has not been changed. According to the analysis results, it has defended against pollution attacks with high fidelity, low resource consumption, and low rate area.
We consider the secure quantum communication over a network with the presence of a malicious adversary who can eavesdrop and contaminate the states. The network consists of noiseless quantum channels with the unit capacity and the nodes which applies noiseless quantum operations. As the main result, when the maximum number m1of the attacked channels over the entire network uses is less than a half of the network transmission rate m0(i.e., m10/2), our code implements secret and correctable quantum communication of the rate m0- 2m1by using the network asymptotic number of times. Our code is universal in the sense that the code is constructed without the knowledge of the specific node operations and the network topology, but instead, every node operation is constrained to the application of an invertible matrix to the basis states. Moreover, our code requires no classical communication. Our code can be thought of as a generalization of the quantum secret sharing.
It is natural in a quantum network system that multiple users intend to send their quantum message to their respective receivers, which is called a multiple unicast quantum network. We propose a canonical method to derive a secure quantum network code over a multiple unicast quantum network from a secure classical network code. Our code correctly transmits quantum states when there is no attack. It also guarantees the secrecy of the transmitted quantum state even with the existence of an attack when the attack satisfies a certain natural condition. In our security proof, the eavesdropper is allowed to modify wiretapped information dependently on the previously wiretapped messages. Our protocol guarantees the secrecy by utilizing one-way classical information transmission (public communication) in the same direction as the quantum network although the verification of quantum information transmission requires two-way classical communication. In the protocol, some nodes may share secret randomness as resources in advance. Our secure network code can be applied to several networks including the butterfly network.
We consider the secure quantum communication over a network with the presence of the malicious adversary who can eavesdrop and contaminate the states. The network consists of the noiseless quantum channels with unit capacity and the nodes which applies noiseless quantum operations. As the main result, when the maximum number m1of the attacked channels over the entire network uses is less than a half of network transmission rate m0(i.e., m10/2), our protocol implements secret and correctable quantum communication of rate m0- 2m1by using the network asymptotic number of times. Our protocol requires no classical communication and no knowledge of network structure, but instead, a node operation is limited to the application of an invertible matrix to the basis states. Our protocol can be thought of as a generalization of honest-dealer verifiable quantum secret sharing. A full version of this paper is accessible at: https://arxiv.org/pdf/1801.03306.pdf.
Abstract Quantum network coding (QNC) can encode and decode quantum information, thereby improving the communication efficiency. However, it is vulnerable to pollution attacks, which will lead to invalid transmission throughout the quantum network. Inspired by the idea of quantum state sharing (QSTS), we introduce QSTS into QNC for the first time to address security issues such as pollution attacks. Subsequently, a novel QNC scheme against pollution attacks based on QSTS is proposed in the paper. In the scheme, the first intermediate node encodes quantum states and performs the first round of sharing. Meanwhile, it conducts an XOR operation on the classical information. The second intermediate node encodes quantum states and performs the second round of sharing. Meanwhile, it duplicates the classical information. Different from the first one, it needs to distribute the quantum state to two receivers by means of quantum teleportation, measurement by using the designed basis, and unitary operations. Finally, the receiver performs the third round of sharing on the quantum state, then verifies the existence of pollution attacks by comparing the quantum information with the classical information. Through performance analysis, the proposed scheme can realize that receivers can receive the quantum state from senders with the fidelity of 1 and the success probability of 1 simultaneously. In addition, we also apply the scheme to the extended butterfly network, which demonstrates superior extensibility and practicability.