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 and zero-error constraints" with "weak secrecy and ϵ-error constraints".
@article{arxiv.1609.04586,
title = {On the Equivalency of Reliability and Security Metrics for Wireline Networks},
author = {Mohammad Mahdi Mojahedian and Amin Gohari and Mohammad Reza Aref},
journal= {arXiv preprint arXiv:1609.04586},
year = {2016}
}