Abstract
Network coding is theoretically the most efficient coding scheme for decentralized networks with better throughput and better robustness. However, if malicious intermediate nodes launch pollution attacks to the data by triumphantly forging network code, the sink node would suffer from failed decoding with bandwidth wasting, longer delay and more overheads. The classic bit by bit digital signature schemes are elegant, but the computation complexity is high, for each bit have to execute a hash computation. The pollution detection schemes based on null key cannot against colluding attacks. The schemes based on homomorphic MAC ensure the sink nodes verify the data, but those intermediate nodes cannot detect the pollution attacks. Above schemes are not enough efficient. In this paper, we propose a new combined security network coding scheme based on homomorphic MAC and null key that overcome the shortage of each other.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Ahlswede, R., et al.: Network information flow. IEEE Trans. Inf. Theory 46(4), 1204–1216 (2000)
Li, S.-Y., Yeung, R.W., Cai, N.: Linear network coding. IEEE Trans. Inf. Theory 49(2), 371–381 (2003)
Gkantsidis, C., Rodriguez, P.R.: Network coding for large scale content distribution. In: Proceedings of the IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM 2005. IEEE (2005)
Katti, S., et al.: XORs in the air: practical wireless network coding. In: ACM SIGCOMM Computer Communication Review. ACM (2006)
Dimakis, A.G., et al.: A survey on network codes for distributed storage. Proc. IEEE 99(3), 476–489 (2011)
Ho, T., et al.: Byzantine modification detection in multicast networks using randomized network coding. In: Proceedings of International Symposium on Information Theory, ISIT 2004. IEEE (2004)
Jaggi, S., et al.: Resilient network coding in the presence of byzantine adversaries. In: 26th IEEE International Conference on Computer Communications, INFOCOM 2007. IEEE (2007)
Krohn, M.N., Freedman, M.J., Mazieres, D.: On-the-fly verification of rateless erasure codes for efficient content distribution. In: Proceedings of the 2004 IEEE Symposium on Security and Privacy. IEEE (2004)
Gkantsidis, C., Rodriguez. P.: Cooperative security for network coding file distribution. In: INFOCOM (2006)
Yu, Z., et al.: An efficient signature-based scheme for securing network coding against pollution attacks. In: The 27th IEEE Conference on Computer Communications, INFOCOM 2008. IEEE (2008)
Zhao, F., et al.: Signatures for content distribution with network coding. In: IEEE International Symposium on Information Theory, ISIT 2007 (2007)
Boneh, D., et al.: Signing a linear subspace: signature schemes for network coding. In: International Workshop on Public Key Cryptography. Springer (2009)
Yu, Z., et al.: An efficient scheme for securing XOR network coding against pollution attacks. In: INFOCOM 2009. IEEE (2009)
Agrawal, S., Boneh, D.: Homomorphic MACs: MAC-based integrity for network coding. In: International Conference on Applied Cryptography and Network Security. Springer (2009)
Li, Y., et al.: RIPPLE authentication for network coding. In: Proceedings of the INFOCOM 2010. IEEE (2010)
Kehdi, E., Li, B.: Null keys: limiting malicious attacks via null space properties of network coding. In: INFOCOM 2009. IEEE (2009)
Cheng, C., et al.: Security analysis and improvements on two homomorphic authentication schemes for network coding. IEEE Trans. Inf. Forensics Secur. 11(5), 993–1002 (2016)
Esfahani, A., Mantas, G., Rodriguez, J.: An efficient null space-based homomorphic MAC scheme against tag pollution attacks in RLNC. IEEE Commun. Lett. 20(5), 918–921 (2016)
Liu, G.: Security analysis and improvement of a tag encoding authentication scheme for network coding. Wuhan Univ. J Nat. Sci. 21(5), 394–398 (2016)
Wang, J., et al.: An efficient short null keys based scheme for securing network coding against pollution attacks. In: Internet Conference of China. Springer (2014)
Zhang, P., et al.: Padding for orthogonality: efficient subspace authentication for network coding. In: Proceedings of the INFOCOM 2011. IEEE (2011)
Charles, D., Jain, K., Lauter, K.: Signatures for network coding. In: 2006 40th Annual Conference on Information Sciences and Systems. IEEE (2006)
Li, X., et al.: Two improved homomorphic MAC schemes in network coding. In: 2015 12th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD). IEEE (2015)
Liu, G., Wang, X.: Homomorphic subspace MAC scheme for secure network coding. ETRI J. 35(1), 173–176 (2013)
Wang, Q., et al.: MIS: malicious nodes identification scheme in network-coding-based peer-to-peer streaming. In: Proceedings of the INFOCOM 2010. IEEE (2010)
Le, A., Markopoulou, A.: Cooperative defense against pollution attacks in network coding using SpaceMac. IEEE J. Sel. Areas Commun. 30(2), 442–449 (2012)
Acknowledgements
This work is supported by the HBUT PHD Fund BSQD12027 and the Hubei Provincial Educational Research Plan D20131404.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this paper
Cite this paper
Xu, C., Chen, Y., Yu, H., Jiang, Y., Sun, G. (2018). A Combined Security Scheme for Network Coding. In: Barolli, L., Zhang, M., Wang, X. (eds) Advances in Internetworking, Data & Web Technologies. EIDWT 2017. Lecture Notes on Data Engineering and Communications Technologies, vol 6. Springer, Cham. https://doi.org/10.1007/978-3-319-59463-7_50
Download citation
DOI: https://doi.org/10.1007/978-3-319-59463-7_50
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-59462-0
Online ISBN: 978-3-319-59463-7
eBook Packages: EngineeringEngineering (R0)