.png){kind=icon}
返回
A Secure Broadcasting Scheme with Network Coding
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2013.060513.130684.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider the secure broadcasting network coding problem over an acyclic network with single source node and two sink nodes. The secret message consists of two private messages and one common message. Secure means that no information about the secret message leaks to the adversary, that is, it achieves the perfect secure and belongs to information theoretic secure. Broadcasting means that different sink nodes receive different parts of the secret message. Given a network topology and network codes, a secure broadcasting scheme is proposed based on the signal space of sink nodes. The secret message is perfect secure if a limited number of edges are wiretapped by adversary. Analysis shows that our scheme is admissible. And the upper bound of the secrecy broadcasting capacity region can be achieved by our scheme. Besides, the sufficient condition of existence for our scheme, i.e., the lower bound of the coding field size, is also derived.
Keyword:
Secure network coding
broadcasting
perfect secrecy
coding field size
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.4
论文数:
1.3W
被引数:
2.2W
机构
引用论文
Highly efficient and recyclable magnetic nanoparticles-supported gold(III)-bipy catalyst for oxidative α-cyanation of tertiary amines.png)
Tetrahedron
TetrahedronIF0
PREAI
分享收藏 没有更多内容
没有更多内容