Universal Secure Network Coding via Rank-Metric Codes

The problem of securing a network coding communication system against an eavesdropper adversary is considered. The network implements linear network coding to deliver n packets from source to each receiver, and the adversary can eavesdrop on \mu arbitrarily chosen links. The objective is to provide reliable communication to all receivers, while guaranteeing that the source information remains information-theoretically secure from the adversary. A coding scheme is proposed that can achieve the maximum possible rate of n-\mu packets. The scheme, which is based on rank-metric codes, has the distinctive property of being universal: it can be applied on top of any communication network without requiring knowledge of or any modifications on the underlying network code. The only requirement of the scheme is that the packet length be at least n, which is shown to be strictly necessary for universal communication at the maximum rate. A further scenario is considered where the adversary is allowed not only to eavesdrop but also to inject up to t erroneous packets into the network, and the network may suffer from a rank deficiency of at most \rho. In this case, the proposed scheme can be extended to achieve the rate of n-\rho-2t-\mu packets. This rate is shown to be optimal under the assumption of zero-error communication.

💡 Research Summary

The paper addresses the problem of securing a linear network‑coding multicast against an eavesdropping adversary and, optionally, against packet‑injection attacks. The network delivers n packets from a single source to multiple receivers using linear combinations over a finite field 𝔽_q. An eavesdropper may observe the packets on any μ links, while a malicious entity may inject up to t erroneous packets anywhere in the network. Moreover, the underlying network code may suffer a rank deficiency of at most ρ (i.e., some receivers may see fewer than n independent linear combinations).

The authors propose a universal coding scheme that works on top of any feasible linear network code without requiring knowledge of the code or any modification of it. The key idea is to treat each packet as an element of an extension field 𝔽_{q^m} (with packet length m symbols over 𝔽_q) and to employ a maximum‑rank‑distance (MRD) code—specifically a Gabidulin code—over this extension field as the outer code. Because the eavesdropper’s observation is a linear transformation of the source matrix, the rank metric precisely captures the amount of information leaked.

Security‑only case.
Choosing an MRD code of dimension k = n – μ yields a minimum rank distance d = n – k + 1 = μ + 1. The eavesdropper’s μ‑dimensional observation cannot distinguish between the q^{k} possible cosets, guaranteeing information‑theoretic secrecy. The receivers, who obtain n independent linear combinations (rank‑full C_R), can invert the linear map and recover the transmitted matrix, thus achieving zero‑error communication at the optimal rate n – μ. The scheme requires only that the packet length satisfy m ≥ n; the authors prove this condition is also necessary for any universal scheme attaining the maximum rate.

Error‑control‑only case.
When the network may lose up to ρ independent equations (rank deficiency) and the adversary may inject t erroneous packets, an MRD code with minimum distance d ≥ 2t + ρ + 1 can correct all errors and compensate for the deficiency. Setting k = n – ρ – 2t yields a rate of n – ρ – 2t, which matches the known capacity for this scenario.

Combined security and error control.
The most general setting combines the two threats. By selecting an MRD code with minimum distance d ≥ 2t + ρ + μ + 1, the outer code simultaneously masks the source from the eavesdropper and corrects up to t injected errors while tolerating a rank deficiency of ρ. The achievable rate becomes

\