The direct application of network coding is vulnerable to pollution attack. In order to solve this security problem, we propose a network coding scheme to prevent it from pollution based on CRC check code. First, this protocol employs a fast parallel CRC check code and message timestamp to effectively resist pollution attack and replay attack. Secondly, by combining with the homomorphic properties of RSA signature algorithm, we ensure the security of CRC and timestamp. Security analysis and efficiency analysis show that applying network coding, parallel CRC check code and message timestamp together can greatly reduce the computational cost of the node and improve the network throughput.
1 Ahlswede R, Cai N, Li SYR, et al. Network information flow. IEEE Trans. on Information Theory, 2000, 46(4):1204-1216.
2 Krohn MN, Freedman MJ, Mazieres D. On-the-fly verification of rateless erasure codes for efficient content distribution. Proc. 2004 IEEE Symposium on Security and Privacy. IEEE. 2004. 226-240.
4 Yu Z, Wei Y, Ramkumar B, et al. An efficient signature-based scheme for securing network coding against pollution attacks. Proc. of the 27th IEEE Conference on Computer Communications(INFOCOM). Phoenix, AZ, US. IEEE Press. April 13-18, 2008. 1409-1417.
5 Yu Z, Wei Y, Ramkumar B, et al. An efficient scheme for securing XOR network coding against pollution attacks. Proc. of IEEE INFOCOM. Rio de Janeiro, Brazil. IEEE Press. April 19-25, 2009. 406-414.
6 Yun A, Cheon JH, Kim Y. Brief contributions on homomorphic signatures for network coding. IEEE Trans. on Computers, 2010, 59(9):1295-1296.
7 Liu GJ, Wang B. Secure network coding against Intra/Inter-generation pollution attacks. China Communications, 2013, 10(8):100-110.
8 Liu J, Liu C, Liu H, et al. Pollution resistance network coding research for Ad hoc network. Proc. of International Conference on Computer Science and Information Technology. Springer India. 2014. 261-268.
9 Zhang P, Jiang Y, Lin C, et al. Padding for orthogonality:efficient subspace authentication for network coding. Proc. of IEEE INFOCOM. Shanghai, China. IEEE Press. April 10-15, 2011. 1026-1034.