Computer Science – Information Theory
Scientific paper
2011-11-17
Computer Science
Information Theory
7 pages, 1 figure, IEEEtrans.cls, submitted to IEEE/ACM Transactions on Networking. Ver 2 corrects computation errors in the n
Scientific paper
We construct a secure network coding that 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 secure network coding 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 is difficult to be ensured in practice.
Hayashi Masahito
Matsumoto Ryutaroh
No associations
LandOfFree
Universal Strongly Secure Network Coding with Dependent and Non-Uniform Messages does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Universal Strongly Secure Network Coding with Dependent and Non-Uniform Messages, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Universal Strongly Secure Network Coding with Dependent and Non-Uniform Messages will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-350345