Loading...

On the equivalency of reliability and security metrics for wireline networks

Mojahedian, M. M ; Sharif University of Technology | 2019

380 Viewed
  1. Type of Document: Article
  2. DOI: 10.24200/sci.2018.5695.1428
  3. Publisher: Sharif University of Technology , 2019
  4. Abstract:
  5. 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 ϵ-error constraints". This is a secure version of the result obtained by Langberg and Effiros on the equivalence of zero-error and ϵ-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. © 2019 Sharif University of Technology. All rights reserved
  6. Keywords:
  7. Perfect secrecy ; Random binning ; Strong secrecy ; Weak secrecy ; Wireline networks ; Zero-error decoding ; ϵ-error decoding ; Decoding ; Errors ; Image coding ; Linear networks ; Network coding ; Error decoding ; Strong secrecies ; Wire line networks ; Zero errors ; Network security ; Communication ; Computer simulation ; Error analysis ; Network design ; Networking ; Security threat
  8. Source: Scientia Iranica ; Volume 26, Issue 3 D , 2019 , Pages 1749-1761 ; 10263098 (ISSN)
  9. URL: http://scientiairanica.sharif.edu/article_20434.html