Capacity bounds for secure network coding
Terence Chan, Alex J. Grant · 2008
We consider the problem of how to securely communicate over networks subject to presence of eavesdroppers. We obtain inner and outer bounds for the set of rate-capacity tuples at which data can be robustly and securely transmitted across an acyclic network under the assumption of error-free links. These bounds generalize the inner and outer bounds obtained for network coding given by Yeung.