2000 character limit reached
On secure network coding with uniform wiretap sets (1208.4390v1)
Published 21 Aug 2012 in cs.IT and math.IT
Abstract: 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, we 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.