论文标题
通过一跳继电器网络保护网络代码
Secure network code over one-hop relay network
论文作者
论文摘要
当网络中存在恶意攻击者时，我们需要同时考虑窃听和污染的可能性。在无环广播网络下，当允许EVE攻击任何$ r $边缘时，显示了线性代码的最佳性。线性代码的最佳性在EVE的另一个假设下没有显示。作为一个无环单播网络的典型示例，我们通过假设EVE仅在每个级别中攻击一个边缘，将重点放在单个传输方案下的单跳继电器网络上。令人惊讶的是，因此，我们发现非线性代码可显着改善单跳继电器网络上线性代码的性能。也就是说，非线器代码实现了该模型上无法通过线性代码实现的不完善的安全性。即使考虑顺序误差对信息泄漏的影响，线性代码的这种优势仍然存在。
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 $r$ 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.
