Abstract
Network coding has gained wide attention nowadays for its significant advantages on many aspects compared with traditional routing mechanism. However, if there are malicious nodes launching pollution attacks by tampering or forging data packets in the communication network, the sink nodes will suffer from failure decoding, together with serious results such as bandwidth wasting, longer transmission delay and increasing computation overheads. The original null keys based pollution detection scheme cannot efficiently defend against pollution attacks when the system has colluding attackers because of high communication overheads. Therefore, we firstly define the concept of complete null space, with the property that no pollution packets can pass its verification. We then propose the idea of partial position detection and design an algorithm to construct short null keys. Secondly, we provide a short null keys based pollution detection scheme with network coding, which has lower overheads compared with the original null keys based pollution detection scheme in composing complete null space. Finally, rigorous theoretical proofs are given to analyze the security of the designed scheme.
J. Wang—This work is supported in part by National Natural Science Foundation of China under grant No. 61202378, 61373164. It was also supported in part by China Postdoctoral Science Foundation No. 2013M531402, 2014T70544, and Application Foundation Research of Suzhou of China No. SYG201401.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Ahlswede, R., Cai, N., Li, S., Yeung, R.: Network information flow. IEEE Trans. Inf. Theor. (TIT) 46(4), 1204–1216 (2000)
Li, S., Yeung, R., Cai, N.: Linear network coding. IEEE Trans. Inf. Theor. 49(2), 371–381 (2003)
Gkantsidis, C., Rodriguez, P.: Network coding for large scale content distribution. In: Proceedings of IEEE International Conference on Computer Communications (INFOCOM), pp. 2235–2245 (2005)
Cai, N., Yeung, R.: Secure network coding. In: Proceeding of IEEE International Symposium on Information Theory (ISIT), p. 323 (2002)
Bhattad, K., Narayanan, K.R.: Weakly secure network coding. In: Proceeding of the First Workshop on Network Coding, Theory, and Applications (NetCod), pp. 1–6 (2005)
Wang, J., Wang, J., Lu, K., Xiao, B., Gu, N.: Optimal linear network coding design for secure unicast with multiple streams. In: Proceedings of IEEE International Conference on Computer Communications, pp. 1–9 (2010)
Wang, J., Wang, J., Lu, K., Qian, Y., Xiao, B., Gu, N.: Optimal design of linear network coding for information theoretically secure unicast. In: Proceedings of IEEE International Conference on Computer Communications, pp. 757–765 (2011)
Wang, J., Wang, J., Lu, K., Xiao, B., Gu, N.: Modeling and optimal design of linear ntwork coding for secure unicast with multiple streams. IEEE Trans. Parallel Distrib. Syst. 24(10), 2025–2035 (2013)
Wang, J., Lu, K., Wang, J.P., Qiao, C.: Untraceability of mobile devices in wireless mesh networks using linear network coding. In: Proceedings of IEEE International Conference on Computer Communications(INFOCOM mini-conference), pp. 270–274 (2013)
Wang, J., Wang, J., Wu, C., Lu, K., Gu, N.: Anonymous communication with network coding against traffic analysis attack. In: Proceedings of IEEE International Conference on Computer Communications, pp. 1008–1016 (2011)
Koetter, R., Mdard, M.: An algebraic approach to network coding. IEEE/ACM Trans. Netw. (TON) 11(5), 782–795 (2003)
Dimakis, A.G., Godfrey, P.B., Wu, Y., Wainwright, M.J., Ramchandran, K.: Network coding for distributed storage systems. In: Proceedings of IEEE International Conference on Computer Communications, pp. 2000–2008 (2007)
Zhang, P., Jiang, Y., Lin, C., Yao, H., Wasef, A., Shen, X.S.: Padding for orthogonality: efficient subspace authentication for network coding. In: Proceedings of IEEE International Conference on Computer Communications (INFOCOM), pp. 1026–1034 (2011)
Charles, D., Jian, K., Lauter, K.: Signature for network coding. Inf. Coding Theory 1(1), 3–14 (2009)
Newell, A., Nita-Rotaru, C.: Split null keys: a null space based defense for pollution attacks in wireless network coding. In: Proceedings of IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON), pp. 479–487 (2012)
Le, A.: Cooperative defense against pollution attacks in network coding using spacemac. Communications 30(2), 442–449 (2012)
Wang, Q., Vu, L., Nahrstedt, K., Khurana, H.: MIS: malicious nodes identification scheme in network-coding-based peer-to-peer streaming. In: Proceedings of IEEE International Conference on Computer Communications, pp. 1–5 (2010)
Gkantsidis, C., Rodriguez, P.: Cooperative security for network coding file distribution. In: Proceedings of IEEE International Conference on Computer Communications (INFOCOM), pp. 1–13 (2006)
Kehdi, E., Li, B.: Null keys:limiting malicious attacks via null space properties of network coding. In: Proceedings of IEEE International Conference on Computer Communications (INFOCOM), pp. 1224–1232 (2009)
Zhao, F., Kalker, T., Medard, M., Han, K.J.: Signatures for content distribution with network coding. In: Proceedings of IEEE International Symposium on Information Theory (ISIT), pp. 24–29 (2007)
Yeung, R.W., Cai, N.: Network error correction. Commun. Inf. Syst. 6(1), 19–35 (2006)
Koetter, R., Kschischang, F.: Coding for errors and erasures in random network coding. IEEE Trans. Inf. Theory 54(8), 3579–3591 (2008)
Wang, J., Wang, J., Zhu, Y., Lu, K.: SNKC: an efficient on-the-fly pollution detection scheme for content distribution with linear network coding. In: Proceedings of International Conference on Embedded and Ubiquitous Computing, pp. 2298–2305 (2013)
Krohn, M., FreedMan, M., Mazieres, D.: On-the-fly verification of rateless erasure codes for efficient content distribution. In: Proceedings of IEEE Symposium on Security and Privacy, pp. 226–240 (2004)
Zhao, Y.: The probability distribution of the matrix rank on fq and the asymptotic properties of the rank. J. Inf. Eng. Inst. 15(4), 47–52 (1996)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, J., Wang, J., Zhu, Y., Jia, C. (2015). An Efficient Short Null Keys Based Scheme for Securing Network Coding Against Pollution Attacks. In: Zhang, S., Xu, K., Xu, M., Wu, J., Wu, C., Zhong, Y. (eds) Frontiers in Internet Technologies. ICoC 2014. Communications in Computer and Information Science, vol 502. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-46826-5_2
Download citation
DOI: https://doi.org/10.1007/978-3-662-46826-5_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-46825-8
Online ISBN: 978-3-662-46826-5
eBook Packages: Computer ScienceComputer Science (R0)