On the equivalency of reliability and security metrics for wireline networks

This study considers a secure network coding problem in which some secret keys are shared among legitimate nodes, and there exists an eavesdropper that is able to hear a subset of links. We show the equivalency of secure network coding under weak and strong secrecy conditions. For linear network cod...

Full description

Saved in:
Bibliographic Details
Published inScientia Iranica. Transaction D, Computer science & engineering, electrical engineering Vol. 26; no. 3; pp. 1749 - 1761
Main Authors Mojahedian, M M, Aref, M R, Gohari, A
Format Journal Article
LanguageEnglish
Published Tehran Sharif University of Technology 01.06.2019
Subjects
Coding
Communication
Electronic surveillance
Equivalence
Errors
Leaking of information
Network reliability
Network security
Security
Online AccessGet full text

Cover

More Information
Summary:This study considers a secure network coding problem in which some secret keys are shared among legitimate nodes, and there exists an eavesdropper that is able to hear a subset of links. We show the equivalency of secure network coding under weak and strong secrecy conditions. For linear network coding, we show a stronger result: equivalency of "perfect secrecy and zero-error constraints" to "weak secrecy and e-error constraints". This is a secure version of the result obtained by Langberg and Effros on the equivalence of zero-error and e-error regions in the network coding problem with co-located sources. Jalali and Ho exploited extractor functions to prove the weak and strong rate region equivalency for this network; however, to prove this equivalency, some tools are developed in random binning, and the equivalency in a slightly more general setting is proved.
DOI:10.24200/sci.2018.5695.1428