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

标题： 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.