On secure network coding with uniform wiretap sets

TL;DR

This paper demonstrates that calculating the secrecy capacity in networks with uniform wiretap sets is computationally as hard as solving the k-unicast problem, highlighting the complexity of secure network coding.

Contribution

It establishes a reduction from the k-unicast problem to the secrecy capacity problem in networks with uniform wiretap sets, revealing its computational difficulty.

Findings

Secrecy capacity determination is as hard as k-unicast problem.

Reduction from k-unicast to secrecy capacity problem.

Highlights complexity of secure network coding.

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.