Secure network code over one-hop relay network
arXiv:2003.12223 · doi:10.1109/JSAIT.2021.3053697
Abstract
When there exists a malicious attacker in the network, we need to consider the possibilities of eavesdropping and the contamination simultaneously. Under an acyclic broadcast network, the optimality of linear codes was shown when Eve is allowed to attack any edges. The optimality of linear codes is not shown under a different assumption for Eve. As a typical example of an acyclic unicast network, we focus on the one-hop relay network under the single transmission scheme by assuming that Eve attacks only one edge in each level. Surprisingly, as a result, we find that a non-linear code significantly improves the performance on the one-hop relay network over linear codes. That is, a non-liner code realizes the imperfect security on this model that cannot be realized by linear codes. This kind of superiority of a linear code still holds even with considering the effect of sequential error injection on information leakage.
References in corpus (12)
- Quantum Random Number Generators
- Practical issues in quantum-key-distribution post-processing
- Universal Secure Network Coding via Rank-Metric Codes
- Relative Generalized Rank Weight of Linear Codes and Its Applications to Network Coding
- On Secure Network Coding with Nonuniform or Restricted Wiretap Sets
- 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
- Secure uniform random number extraction via incoherent strategies
- Reduction Theorem for Secrecy over Linear Network Code for Active Attacks
- On (Secure) Information flow for Multiple-Unicast Sessions: Analysis with Butterfly Network
- On Secure Network Coding for Two Unicast Sessions