Asymptotically Secure Network Code for Active Attacks and its Application to Network Quantum Key Distribution
arXiv:2003.12225
Abstract
When there exists a malicious attacker in the network, we need to be careful of eavesdropping and contamination. This problem is crucial for network communication when the network is realized by a partially trusted relay of quantum key distribution. We discuss the asymptotic rate in a linear network with the secrecy and robustness conditions when the above type of attacker exists. Also, under the same setting, we discuss the asymptotic rate in a linear network when we impose the secrecy condition alone. Then, we apply these results to the network composed of a partially trusted relay of quantum key distribution, which enables us to realize secure long-distance communication via short-distance quantum key distribution.
arXiv commentarXiv admin note: text overlap with arXiv:1703.00723
References in corpus (10)
- Long-distance quantum communication with atomic ensembles and linear optics
- Universal Secure Network Coding via Rank-Metric Codes
- Relating different quantum generalizations of the conditional Renyi entropy
- More Efficient Privacy Amplification with Less Random Seeds via Dual Universal Hash Function
- Relative Generalized Rank Weight of Linear Codes and Its Applications to Network Coding
- Universal Secure Multiplex Network Coding with Dependent and Non-Uniform Messages
- Physical Layer Security Protocol for Poisson Channels for Passive Man-in-the-middle Attack
- Reduction Theorem for Secrecy over Linear Network Code for Active Attacks
- Finite-Length Analyses for Source and Channel Coding on Markov Chains
- Universal Construction of Cheater-Identifiable Secret Sharing Against Rushing Cheaters Based on Message Authentication