Vulnerability of MRD-Code-Based Universal Secure Error-Correcting Network Codes under Time-Varying Jamming Links
Jun Kurihara, Tomohiko Uyematsu · Tokyo Tech Research Repository (Tokyo Institute of Technology) · 2011
In order to provide reliable and secure communication against eavesdroppers and jammers over networks, Universal Secure Error-Correcting Network Codes (USECNC) based on Maximum-Rank-Distance (MRD) codes have been introduced. This code can be applied to any underlying network codes. However, Shioji et al. introduced a reasonable network model against the code. In their model, an attacker eavesdrops information symbols from some links, where the set of eavesdropping links is re-selected during one packet transmission. The MRD-code-based USECNC cannot guarantee the security against eavesdroppers under this model. Inspired by Shioji et al.’s result, this paper considers the model such that the set of links that jamming (error) symbols are injected into is re-selected for each time slot. We show that the MRDcode-based USECNC cannot guarantee the error-correcting capability under the model of time-varying jamming links, even if the number of jamming links is limited to only one. Furthermore, by introducing a restriction on the field of local coding vectors in the network coding, we propose a simple solution to the problem of time-varying jamming links for MRD-code-based USECNC. Keywords-Network Coding; Secure Network Coding; Network Error-Correction; Jamming