On the optimal flow allocation and information theoretically secure network coding design for multiple multicasts
On the optimal flow allocation and information theoretically secure network coding design for multiple multicasts
复制标题
多播最优流量分配与信息安全网络编码设计
DOI：
10.1002/dac.3526
复制
发表时间：
2018-04
期刊：
影响因子：
--
通讯作者：
Zhu Yanqin
中科院分区：
文献类型：
--
作者：
Ding Weiwei;Wang Jin;Wang Xiumin;Lu Kejie;Zhao Ruimin;Zhu Yanqin
使用线性网络编码（LNC），通信网络中传输的数据包是编码数据包，它们是原始数据数据包的线性组合。由于编码数据包对于多播中的多个目的地可能很有用，因此LNC一直是
With linear network coding (LNC), the data packets transmitted in a communication network are coded packets, which are linear combinations of original data packets. Since the coded packets can be useful for multiple destinations in multicast, LNC has been shown as a promising technology to improve the network throughput. On the other hand, the original data packets can be encoded with random symbols and transmitted in the network to make sure that a passive attacker cannot obtain the information of these original data packets when the passive attacker cannot obtain enough coded packets. Therefore, LNC also provides secure transmission without using the traditional encryption and decryption. In this paper, we will study an Information Theoretically Secure Multiple Multicasts (ITSMM) problem with the following objectives: (1) maximizing the secure transmission rate (STR), (2) minimizing the random symbol rate (RSR), and (3) minimizing the bandwidth cost (BC), when the data transmission is information theoretically secure. We firstly theoretically analyze the ITSMM problem, which shows that it is equivalent to a problem of network flow with constraints on each intermediate node. We then formulate the ITSMM problem by 3 linear programmings to get the maximum STR, the minimum RSR, and the minimum BC. After that, we prove the sufficient condition for the size of finite field over which the information theoretically secure linear multicast code (ITSLMC) can be designed. At last, we give extensive simulations, which show that the proposed algorithms are effective and efficient.
登录
查看更多内容
DOI：
10.1109/infcom.2011.5935296
发表时间：
2011-04
期刊：
2011 Proceedings IEEE INFOCOM
影响因子：
--
作者：
Jin Wang;Jianping Wang;K. Lu;Y. Qian;Bin Xiao;Naijie Gu
通讯作者：
Jin Wang;Jianping Wang;K. Lu;Y. Qian;Bin Xiao;Naijie Gu
通过随机网络编码中秘密且可靠的编码机制对抗恶意对手
影响因子：
2.1
作者：
Chen, Siguang;Wu, Meng;Lu, Weifeng
通讯作者：
Lu, Weifeng
DOI：
10.1016/j.comnet.2012.11.017
发表时间：
2013-04
期刊：
Comput. Networks
影响因子：
--
作者：
M. Raayatpanah;H. Fathabadi;B. Khalaj;S. Khodayifar
通讯作者：
M. Raayatpanah;H. Fathabadi;B. Khalaj;S. Khodayifar
影响因子：
2.1
作者：
S. Adibi
通讯作者：
S. Adibi
影响因子：
2.5
作者：
D. Lun;Niranjan Ratnakar;M. Médard;R. Koetter;David R Karger;T. Ho;E. Ahmed;Fang Zhao
通讯作者：
D. Lun;Niranjan Ratnakar;M. Médard;R. Koetter;David R Karger;T. Ho;E. Ahmed;Fang Zhao