Security for Wiretap Networks via Rank-Metric Codes

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.

💡 Research Summary

The paper addresses the problem of securing linear network‑coded multicast communications against a passive eavesdropper who can observe any μ links of her choice. In this setting the source wishes to deliver n packets to each receiver, and information‑theoretic security requires that the adversary obtain no knowledge about the transmitted secret messages. The authors first recall the well‑known bound that the maximum achievable secure rate is k = n − μ packets; this follows from the fact that each observed link can at most reveal one independent linear combination of the transmitted symbols.

The main contribution is a universal coding construction that attains this bound without any modification of the underlying network code. “Universal” means that the scheme can be layered on top of any linear (even randomly generated) network code, and it does not require knowledge of the specific coding coefficients used inside the network. The construction is inspired by the Ozarow‑Wyner wiretap channel of type II and its later extension to networks by Rouayheb and Soljanin. In the classic Ozarow‑Wyner scheme the source encodes the secret message with a linear MDS code and adds a random coset leader; the authors replace the MDS code by a maximum‑rank‑distance (MRD) code defined over the same extension field in which the network operates.

Specifically, let the network operate over the field 𝔽_{q^m}. Choose an