Secure-broadcast codes over linear-deterministic channels

We study a non-multicast secure network coding problem with two receivers. First we study a linear-deterministic channel model with two receivers and a collection of eavesdroppers, which generalizes the Ozarow-Wyner wiretap channel II. The secrecy capacity region for independent and common messages is characterized and is achieved by concatenating a coset-coding scheme based on maximum rank distance codes with a repetition code. By applying our coding scheme at the source node of a network that uses an underlying generic network code we also establish the secrecy capacity region of a network coding problem with two sinks and one sender node.