Secure Multiplex Network Coding

Abstract

In the secure network coding for multicasting, there is loss of information rate due to inclusion of random bits at the source node. We show a method to eliminate that loss of information rate by using multiple statistically independent messages to be kept secret from an eavesdropper. The proposed scheme is an adaptation of Yamamoto et al.'s secure multiplex coding to the secure network coding.

IEEEtran.sty, 7 pages, no figure, Version 2 will appear in Proc. NetCod 2011, Beijing, China. Version 3 adds an appendix proving that the mutual information can be made exactly zero

References in corpus (4)

• Exponential decreasing rate of leaked information in universal random privacy amplification
• Universal Secure Network Coding via Rank-Metric Codes
• Vulnerability of MRD-Code-based Universal Secure Network Coding against Stronger Eavesdroppers
• Secure Multiplex Coding with a Common Message

Cited by in corpus (10)

• Quantum network communication -- the butterfly and beyond
• A father protocol for quantum broadcast channels
• Relative Generalized Rank Weight of Linear Codes and Its Applications to Network Coding
• Universal Secure Multiplex Network Coding with Dependent and Non-Uniform Messages
• Secure Network Code for Adaptive and Active Attacks with No-Randomness in Intermediate Nodes
• Reduction Theorem for Secrecy over Linear Network Code for Active Attacks
• Secure network code over one-hop relay network
• Finite-Block-Length Analysis in Classical and Quantum Information Theory
• New Parameters of Linear Codes Expressing Security Performance of Universal Secure Network Coding
• Secure Multiplex Coding with a Common Message