On Secure Network Coding With Uniform Wiretap Sets
This paper shows determining the secrecy capacity of a unicast network with uniform wiretap sets is at least as difficult as the k-unicast problem. In particular, the authors show that a general k-unicast problem can be reduced to the problem of finding the secrecy capacity of a corresponding single unicast network with uniform link capacities and one arbitrary wiretap link. The secure network coding problem, introduced by Cai and Yeung, concerns information theoretically secure communication over a network where an unknown subset of network links may be wiretapped. A secure code ensures that the wiretapper obtains no information about the secure message being communicated.