Universal Secure Multiplex Network Coding with Dependent and Non-Uniform Messages

Abstract

We consider the random linear precoder at the source node as a secure network coding. We prove that it is strongly secure in the sense of Harada and Yamamoto and universal secure in the sense of Silva and Kschischang, while allowing arbitrary small but nonzero mutual information to the eavesdropper. Our security proof allows statistically dependent and non-uniform multiple secret messages, while all previous constructions of weakly or strongly secure network coding assumed independent and uniform messages, which are difficult to be ensured in practice.

10 pages, 1 figure, IEEEtrans.cls. Online published in IEEE Trans. Inform. Theory

References in corpus (2)

• Relative Generalized Rank Weight of Linear Codes and Its Applications to Network Coding
• Secure Network Coding for Wiretap Networks of Type II

Cited by in corpus (11)

• More Efficient Privacy Amplification with Less Random Seeds via Dual Universal Hash Function
• Uniform Random Number Generation from Markov Chains: Non-Asymptotic and Asymptotic Analyses
• Secure Network Code for Adaptive and Active Attacks with No-Randomness in Intermediate Nodes
• Secure Quantum Network Coding on Butterfly Network
• Secure Quantum Network Code without Classical Communication
• Reduction Theorem for Secrecy over Linear Network Code for Active Attacks
• Secure network code over one-hop relay network
• Message Randomization and Strong Security in Quantum Stabilizer-Based Secret Sharing for Classical Secrets
• Secrecy and Robustness for Active Attack in Secure Network Coding and its Application to Network Quantum Key Distribution
• Asymptotically Secure Network Code for Active Attacks and its Application to Network Quantum Key Distribution
• Single-Shot Secure Quantum Network Coding for General Multiple Unicast Network with Free One-Way Public Communication