2012/08/21 by Wentao Huang, Huang, Wentao, Tracey Ho +6
Computer Science · Engineering · Mathematics · #Cooperative Communication and Network Coding #Full-Duplex Wireless Communications #Wireless Communication Security Techniques #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1208.4390
arxiv created 2012/08/21 · arxiv updated 2015/03/20
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.