Explicit construction of universal strongly secure network coding via MRD codes
Jun Kurihara, Tomohiko Uyematsu, Ryutaroh Matsumoto · 2012
The universal strongly secure network coding scheme allows communication at maximum rate while ensuring that, independently from the underlying network code, no part of the secret message is revealed to the wiretapper. Although Silva and Kschischang showed the existence of such a scheme, the explicit construction remained an open question. This paper demonstrates an explicit construction of the scheme that uses secret sharing schemes based on maximum rank distance (MRD) codes, which can be viewed as a special case of Ozarow-Wyner coset coding scheme.