Universal Secure Multiplex Network Coding With Dependent and Non-Uniform Messages
Universal Secure Multiplex Network Coding With Dependent and Non-Uniform Messages
复制标题
DOI：
10.1109/tit.2017.2694012
复制
发表时间：
2017-06-01
影响因子：
2.5
通讯作者：
Hayashi, Masahito
中科院分区：
文献类型：
--
作者：
Matsumoto, Ryutaroh;Hayashi, Masahito
我们认为在源节点的随机线性预编码器作为一个安全的网络编码。我们证明了它在Harada和Yamamoto意义下是强安全的，在Silva和Kschischang意义下是泛安全的，同时允许窃听者获得任意小但非零的互信息.我们的安全性证明允许统计相关和非均匀的多个秘密消息，而所有弱或强安全网络编码的构造都假设独立和均匀的消息，这在实践中很难得到保证。
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.