Security

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

Free registration required

Executive Summary

The authors consider the random linear precoder at the source node as a secure network coding. They 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. Their 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.

  • Format: PDF
  • Size: 167.99 KB