Low-overhead Secure Network Coding based on Chaotic Sequence
Guangxian Xu, Xiao Fu, Wei Wu · Applied Mathematics & Information Sciences · 2013
Abstract: A minimum overhead secure network coding based on chaotic sequence is presented in this paper. And only the source need to be modified, intermediate nodes implement a classical distributed network code. So the proposed scheme is applied to all the linear network coding. Combine the chaotic sequence with original source information vector, because of the high randomness and the sensitivity to initial state of chaotic sequence, the presented network code is ”One-Time Pad (OTP)”. So the secure network coding achieves complete secrecy. This scheme requires only one noisy symbol to be embedded in the original information symbol vector to achieve complete secrecy. The theoretical analysis confirm that this scheme can achieve the information-theoretic security condition and the signalling overhead to obtain complete security is minimized, while the attacker has limited wiretapping ability.