标题： 通过秩度量码的窃听网络安全性 显示英文标题

标题： Security for Wiretap Networks via Rank-Metric Codes

摘要： 考虑了在网络编码通信系统中对抗窃听者对手的安全问题。 网络采用线性网络编码，将$n$个数据包从源发送到每个接收器，窃听者可以监听$\mu$个任意选择的链路。 提出了一种编码方案，可以实现最大可能的速率$k=n-\mu$个在信息论上对对手安全的数据包。 我们方案的一个显著特点是其通用性：可以在任何通信网络上应用，而无需了解或修改底层网络编码。 事实上，甚至可以使用随机网络编码。 我们的方法基于 Rouayheb-Soljanin 对窃听网络的表述，将其视为 Ozarow-Wyner 类型 II 窃听信道的推广。 本质上，Ozarow-Wyner 的 coset 编码方案中的线性 MDS 码被替换为在进行线性网络编码的域的扩展上的最大秩距离码。 显示英文摘要

摘要： The problem of securing a network coding communication system against a wiretapper adversary is considered. The network implements linear network coding to deliver $n$ packets from source to each receiver, and the wiretapper can eavesdrop on $\mu$ arbitrarily chosen links. A coding scheme is proposed that can achieve the maximum possible rate of $k=n-\mu$ packets that are information-theoretically secure from the adversary. A distinctive feature of our scheme is that it is universal: it can be applied on top of any communication network without requiring knowledge of or any modifications on the underlying network code. In fact, even a randomized network code can be used. Our approach is based on Rouayheb-Soljanin's formulation of a wiretap network as a generalization of the Ozarow-Wyner wiretap channel of type II. Essentially, the linear MDS code in Ozarow-Wyner's coset coding scheme is replaced by a maximum-rank-distance code over an extension of the field in which linear network coding operations are performed.