On the equivalency of reliability and security metrics for wireline networks

“To be considered for the 2017 IEEE Jack Keil Wolf ISIT Student Paper Award” In this paper, we show the equivalency of weak and strong secrecy conditions for a large class of secure network coding problems. When we restrict to linear operations, we show the equivalency of “perfect secrecy with zero-error constraint” and “weak secrecy with ∊-error constraint”.