On secure network coding with uniform wiretap sets
Information Theory
2015-03-20 v1 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.
Keywords
Cite
@article{arxiv.1208.4390,
title = {On secure network coding with uniform wiretap sets},
author = {Wentao Huang and Tracey Ho and Michael Langberg and Joerg Kliewer},
journal= {arXiv preprint arXiv:1208.4390},
year = {2015}
}