Low-Complexity Secure Network Coding Against Wiretapping Using Intra/Inter-generation Coding

• Published in: China communications Vol. 12; no. 6; pp. 116 - 125
• Main Authors: Liu, Guangjun, Liu, Binyue, Liu, Ximeng, Li, Fang, Guo, Wangmei
• Format: Journal Article
• Language: English
• Published: China Institute of Communications 01.06.2015; School of Information Engineering, Xi'an University, Xi'an 710065, Shaanxi, China%State Key Laboratory of Integrated Service Networks, Xidian University, Xi'an 710071, Shaanxi, China
• Subjects: Bandwidth; Encoding; Encryption; Network coding; network coding; security; wiretappingattacks; algebraic coding; encryption; Receivers; 低复杂度; 安全性能; 带宽控制; 帧间编码; 窃听; 编码模式; 网络编码; 计算复杂度; algebraic coding; network coding; security; encryption; wiretapping attacks
• ISSN: 1673-5447
• DOI: 10.1109/CC.2015.7122470

Existing solutions against wiretap- ping attacks for network coding either bring significant bandwidth overhead or incur a high computational complexity. In order to reduce the security overhead of the existing solutions for securing network coding, a novel securing network coding paradigm is presented relying on two coding models： intra-generation coding and inter-generation coding. The basic idea to secure network coding using intra-generation coding is to limit the encryption operations for each generation, and then subject the scram- bled and the remaining original source vectors to a linear transformation. This method is then generalized seamlessly using inter-generation coding by further exploiting the algebraic structure of network coding. We show that the proposed schemes have properties of low-complexity security, little bandwidth con- sumption, and high efficiency in integrating with the existing security techniques effectively.