Low-complexity secure network coding against wiretapping using intra/inter-generation coding

Existing solutions against wiretapping 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 scrambled 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 consumption, and high efficiency in integrating with the existing security techniques effectively.