Reduction Theorem for Secrecy over Linear Network Code for Active Attacks
arXiv:2003.11722 · doi:10.3390/e22091053
Abstract
We discuss the effect of sequential error injection on information leakage under a network code. We formulate a network code for the single transmission setting and the multiple transmission setting. Under this formulation, we show that the eavesdropper cannot improve the power of eavesdropping by sequential error injection when the operations in the network are linear operations. We demonstrate the usefulness of this reduction theorem by applying a concrete example of network.
References in corpus (9)
- Exponential decreasing rate of leaked information in universal random privacy amplification
- Relative Generalized Rank Weight of Linear Codes and Its Applications to Network Coding
- Universal Secure Multiplex Network Coding with Dependent and Non-Uniform Messages
- Secure Network Code for Adaptive and Active Attacks with No-Randomness in Intermediate Nodes
- Secure Multiplex Network Coding
- Vulnerability of MRD-Code-based Universal Secure Network Coding against Stronger Eavesdroppers
- Secure network code over one-hop relay network
- Coding against a Limited-view Adversary: The Effect of Causality and Feedback
- Asymptotically Secure Network Code for Active Attacks and its Application to Network Quantum Key Distribution