On secure network coding with uniform wiretap sets

• DOI: 10.1109/netcod.2013.6570814
• Publication Date: 2013-08-14T11:40:54Z
• Authors: Wentao Huang; Tracey Ho; Michael Langberg; Joerg Kliewer
• Keywords: Unicast; Linear network coding

This paper studies secure unicast communication over a network with uniform wiretap sets and shows that, when nodes can independently generate randomness, determining the secrecy capacity is at least as difficult k-unicast coding problem. In particular, we show that general problem be reduced to of finding corresponding single link capacities any one link. We propose low-complexity linear optimization-based achievable strategy involving global random keys generated anywhere in network, an efficient greedy algorithm further improves rate by exploiting local keys.