arXiv:2003.13293 · IEEE Transactions on Information Theory

Single-Shot Secure Quantum Network Coding for General Multiple Unicast Network With Free One-Way Public Communication

Go Kato, Masaki Owari, Masahito Hayashi

Published May 10, 2021• 15 citations

Abstract

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.

DOI: 10.1109/tit.2021.3078812

Related papers

Single-shot secure quantum network coding on butterfly network with free public communication

Masaki Owari, Go Kato, Masahito Hayashi

Abstract Quantum network coding on the butterfly network has been studied as a typical example of quantum multiple cast network. We propose a secure quantum network code for the butterfly network with free public classical communication in the multiple unicast setting under restricted eavesdropper’s power. This protocol certainly transmits quantum states when there is no attack. We also show the secrecy with shared randomness as additional resource when the eavesdropper wiretaps one of the channels in the butterfly network and also derives the information sending through public classical communication. Our protocol does not require verification process, which ensures single-shot security.

arXiv:1705.01474Quantum Science and TechnologySep 6, 201724 citations

Quantum Network Code for Multiple-Unicast Network with Quantum Invertible Linear Operations

Seunghoan Song, Masahito Hayashi

This paper considers the communication over a quantum multiple-unicast network where r sender-receiver pairs communicate independent quantum states. We concretely construct a quantum network code for the quantum multiple-unicast network as a generalization of the code [Song and Hayashi, arxiv:1801.03306, 2018] for the quantum unicast network. When the given node operations are restricted to invertible linear operations between bit basis states and the rates of transmissions and interferences are restricted, our code certainly transmits a quantum state for each sender-receiver pair by n-use of the network asymptotically, which guarantees no information leakage to the other users. Our code is implemented only by the coding operation in the senders and receivers and employs no classical communication and no manipulation of the node operations. Several networks that our code can be applied are also given.

arXiv:1805.10428Leibniz international proceedings in informaticsJan 1, 20185 citations

Quantum network coding via time-bin multiplexing

Feng Liu, Yu‐Guang Yang

Quantum network coding is used to overcome the congestion problem in quantum networks, which can effectively improve the transmission efficiency and total throughput of quantum networks. Here, we propose a time-bin complexing network coding method for crossly transmitting two arbitrary single-qubit states over the butterfly network. To solve the congestion problem, a single photon with polarization and time-bin degrees of freedom acts as a bridge to entangle the two-dimensional quantum memories of two intermediate nodes in a heralded way. Finally, quantum 2-pair unicast communication is completed based on quantum teleportation and the heralded double entangled channels. Concerning dishonest intermediate nodes being concerned, a security-enhanced quantum 2-pair unicast communication protocol is presented. Security and performance are analyzed, and the result shows that the improved protocol is secure against the general entangle-measure attack of intermediate nodes. It can be extended to multiple unicast communication over a more general quantum network by exploiting the time-bin complexing technique.

Zhongguo kexue. Wulixue Lixue TianwenxueJun 22, 20221 citation

Perfect Quantum Network Coding Independent of Classical Network Solutions

Jing Li, Xiu‐Bo Chen, Gang Xu +2 more

Quantum network coding with classical assistance can transmit quantum information with fidelity one in error-free quantum channels. However, the dependency on classical network solutions leads to higher communication complexity and transmission congestion over a large-scale network with bottleneck channels. We find that certain types of quantum operation are sufficient to support multiple unicast sessions over the extended butterfly network. Furthermore, this construction decouples classical communication (assisting decoding information) from classical network solution. Based on this design, we propose an optimal protocol for this specific network, which significantly reduces the communication cost.

IEEE Communications LettersDec 9, 201445 citations

Quantum network coding — How can network coding be applied to quantum information?

Harumichi Nishimura

Nowadays, network coding has been a very successful topic in information theory including many applications such as wireless networks while one of the simplest benefits is the efficient transmission in networks by allowing us to encode the transmitted information at every intermediate node. Since quantum information is much more expensive for communication than classical information, it was natural that this benefit made quantum researchers motivate the study of “quantum network coding.” This paper reports the current status of quantum network coding. At present, quantum network coding mostly means sending quantum information (rather than classical information) in a quantum network. Since quantum information cannot be cloned (the quantum no-cloning theorem), multiple unicast networks have been well-studied (in several settings). We present some of the known possibilities and limitations, and future works of quantum network coding, focusing on multiple unicast networks.

International Symposium on Network Coding (NetCod)Jun 1, 201317 citations

Network Network Coding-Based Post-Quantum Cryptography.

Alejandro Cohen, Rafael G. L. D’Oliveira, Salman Salamatian +1 more

We propose a novel hybrid universal network-coding cryptosystem (HUNCC) to obtain secure post-quantum cryptography at high communication rates. The secure network-coding scheme we offer is hybrid in the sense that it combines information-theory security with public-key cryptography. In addition, the scheme is general and can be applied to any communication network, and to any public-key cryptosystem. Our hybrid scheme is based on the information theoretic notion of individual secrecy, which traditionally relies on the assumption that an eavesdropper can only observe a subset of the communication links between the trusted parties - an assumption that is often challenging to enforce. For this setting, several code constructions have been developed, where the messages are linearly mixed before transmission over each of the paths in a way that guarantees that an adversary which observes only a subset has sufficient uncertainty about each individual message. Instead, in this paper, we take a computational viewpoint, and construct a coding scheme in which an arbitrary secure cryptosystem is utilized on a subset of the links, while a pre-processing similar to the one in individual security is utilized. Under this scheme, we demonstrate 1) a computational security guarantee for an adversary which observes the entirety of the links 2) an information theoretic security guarantee for an adversary which observes a subset of the links, and 3) information rates which approach the capacity of the network and greatly improve upon the current solutions. A perhaps surprising consequence of our scheme is that, to guarantee a computational security level b, it is sufficient to encrypt a single link using a computational post-quantum scheme. In addition, the information rate approaches 1 as the number of communication links increases.

Sep 3, 20200 citations