The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.01 - Jan. (2014 vol.25)
pp: 33-42
Xiaohu Wu , University of Science and Technology of China, Hefei
Yinlong Xu , University of Science and Technology of China, Hefei
Chau Yuen , Singapore University of Technology and Design, Singapore
Liping Xiang , University of Science and Technology of China, Hefei
ABSTRACT
Network coding allows intermediate nodes to encode data packets to improve network throughput and robustness. However, it increases the propagation speed of polluted data packets if a malicious node injects fake data packets into the network, which degrades the bandwidth efficiency greatly and leads to incorrect decoding at sinks. In this paper, insights on new mathematical relations in linear network coding are presented and a key predistribution-based tag encoding scheme KEPTE is proposed, which enables all intermediate nodes and sinks to detect the correctness of the received data packets. Furthermore, the security of KEPTE with regard to pollution attack and tag pollution attack is quantitatively analyzed. The performance of KEPTE is competitive in terms of: 1) low computational complexity; 2) the ability that all intermediate nodes and sinks detect pollution attack; 3) the ability that all intermediate nodes and sinks detect tag pollution attack; and 4) high fault-tolerance ability. To the best of our knowledge, the existing key predistribution-based schemes aiming at pollution detection can only achieve at most three points as described above. Finally, discussions on the application of KEPTE to practical network coding are also presented.
INDEX TERMS
Vectors, Pollution, Network coding, Encoding, Equations, Security, Educational institutions,security, Network coding, pollution attack, Byzantine attack, compromised nodes
CITATION
Xiaohu Wu, Yinlong Xu, Chau Yuen, Liping Xiang, "A Tag Encoding Scheme against Pollution Attack to Linear Network Coding", IEEE Transactions on Parallel & Distributed Systems, vol.25, no. 1, pp. 33-42, Jan. 2014, doi:10.1109/TPDS.2013.24
REFERENCES
[1] R. Ahlswede, N. Cai, S.-Y.R. Li, and R.W. Yeung, "Network Information Flow," IEEE Trans. Information Theory, vol. 46, no. 4, pp. 1204-1216, July 2000.
[2] S.R. Li, R. Yeung, and N. Cai, "Linear Network Coding," IEEE Trans. Information Theory, vol. 49, no. 2, pp. 371-381, Feb. 2003.
[3] T. Ho, M. Medard, R. Koetter, D.R. Karger, M. Effros, J. Shi, and B. Leong, "A Random Linear Network Coding Approach to Multicast," IEEE Trans. Information Theory, vol. 52, no. 10, pp. 4413-4430, Oct. 2006.
[4] S. Jaggi, M. Langberg, S. Katti, T. Ho, D. Katabi, M. Medard, and M. Effros, "Resilient Network Coding in the Presence of Byzantine Adversaries," IEEE Trans. Information Theory, vol. 54, no. 6, pp. 2596-2603, June 2008.
[5] A. Yun, J. Cheon, and Y. Kim, "On Homomorphic Signatures for Network Coding," IEEE Trans. Computers, vol. 59, no. 9, pp. 1295-1296, Mar. 2010.
[6] Z. Yu, Y. Wei, B. Ramkumar, and Y. Guan, "An Efficient Signature-Based Scheme for Securing Network Coding against Pollution Attacks," Proc. IEEE INFOCOM, Apr. 2008.
[7] R. Gennaro, J. Katz, H. Krawczyk, and T. Rabin, "Secure Network Coding over the Integers," Proc. 13th Int'l Conf. Practice and Theory in Public Key Cryptography (PKC '10), May 2010.
[8] Y. Jiang, H. Zhu, M. Shi, X. Shen, and C. Lin, "An Efficient Dynamic-Identity Based Signature Scheme for Secure Network Coding," Computer Networks: The Int'l J. Computer and Telecomm. Networking, vol. 54, no. 1, pp. 28-40, Jan. 2010.
[9] M. Krohn, M. Freedman, and D. Mazieres, "On-the-Fly Verification of Rateless Erasure Codes for Efficient Content Distribution," Proc. IEEE Symp. Security and Privacy, May 2004.
[10] F. Zhao, T. Kalker, M. Medard, and K.J. Han, "Signatures for Content Distribution with Network Coding," Proc. IEEE Int'l Symp. Information Theory, June 2007.
[11] G. Gkantsidisand and P. Rodriguez, "Cooperative Security for Network Coding File Distribution," Proc. IEEE INFOCOM, Apr. 2006.
[12] J. Dong, R. Curtmola, and C. Nita-Rotaru, "Practical Defenses Against Pollution Attacks in Wireless Network Coding," ACM Trans. Information and System Security, vol. 14, no. 1,article 7, May 2011.
[13] S. Agrawal and D. Boneh, "Homomorphic MACs: MAC-Based Integrity for Network Coding," Proc. Int'l Conf. Applied Cryptography and Network Security, June 2009.
[14] Z. Yu, Y. Wei, B. Ramkumar, and Y. Guan, "An Efficient Scheme for Securing XOR Network Coding against Pollution Attacks," Proc. IEEE INFOCOM, Apr. 2009.
[15] P. Zhang, Y. Jiang, C. Lin, H. Yao, A. Wasef, and X.S. Shen, "Padding for Orthogonality : Efficient Subspace Authentication for Network Coding," Proc. IEEE INFOCOM, Apr. 2011.
[16] Y. Li, H. Yao, M. Chen, S. Jaggi, and A. Rosen, "RIPPLE Authentication for Network Coding," Proc. IEEE INFOCOM, Mar. 2010.
[17] A. Le and A. Markopoulou, "Cooperative Defense against Pollution Attacks in Network Coding Using SpaceMac," IEEE J. Selected Areas in Comm. on Cooperative Networking Challenges and Applications, vol. 30, no. 2, pp. 442-449, Feb. 2012.
[18] Q. Wang, L. Vu, K. Nahrstedt, and H. Khurana, "Identifying Malicious Nodes in Network-Coding-Based Peer-to-Peer Streaming Networks," Proc. IEEE INFOCOM, Mar. 2010.
[19] R. Koetter and F.R. Kschischang, "Coding for Errors and Erasures in Random Network Coding," IEEE Trans. Information Theory, vol. 54, no. 8, pp. 3579-3591, Aug. 2008.
[20] P. Chou, Y. Wu, and K. Jain, "Practical Network Coding," Proc. Allerton Conf. Comm., Control, and Computing, Oct. 2003.
[21] H. Wang, "Cover-Free Families and Their Applications in Network Security," technical report, Division of Math. Sciences School of Physical and Math. Sciences, Nanyang Technological Univ., 2009.
[22] A. Le and A. Markopoulou, "TESLA-Based Defense against Pollution Attacks in P2P Systems with Network Coding," Proc. IEEE Int'l Symp. Network Coding (NetCod), July 2011.
[23] N. Cai and R.W. Yeung, "Network Error Correction, Part 2: Lower Bounds," Comm. in Information and Systems, vol. 6, no. 1, pp. 37-54, 2006.
[24] Z. Zhang, "Network Error Correction Coding in Packetized Networks," Proc. IEEE Information Theory Workshop, Oct. 2006.
[25] F. Oggier and H. Fathi, "An Authentication Code against Pollution Attacks in Network Coding," IEEE/ACM Trans. Networking, vol. 19, no. 6, pp. 1587-1596, Mar. 2011.
[26] D. Petrovic, K. Ramchandran, and J. Rabaey, "Overcoming Untuned Radios in Wireless Networks with Network Coding," IEEE Trans. Information Theory, vol. 52, no. 6, pp. 2649-2657, June 2006.
[27] C. Gkantsidis and P. Rodriguez, "Network Coding for Large Scale File Distribution," Proc. IEEE INFOCOM, Mar. 2005.
[28] Y. Zhu, B. Li, and J. Guo, "Multicast with Network Coding in Application Layer Overlay Networks," IEEE J. Selected Areas in Comm. on Recent Advances in Service Overlay Networks, vol. 22, no. 1, pp. 107-120, Jan. 2004.
[29] Q. Li, J.C.S. Lui, and D.-M. Chiu, "On the Security and Efficiency of Content Distribution via Network Coding," IEEE Trans. Dependable and Secure Computing, vol. 9, no. 2, pp. 211-221, Jan. 2011.
[30] X. Wu, Y. Xu, L. Xiang, and W. Xu, "A Hybrid Scheme against Pollution Attack in Network Coding," Proc. IEEE Int'l Symp. Network Coding (NetCod), July 2011.
[31] W. Stallings, Cryptography and Network Security, fifth ed. Prentice Hall, 2011.
[32] E. Barker, W. Barker, W. Burr, W. Polk, and M. Smid, "Recommendation for Key Management - Part 1: General," NIST Special Publication 800-57, Mar. 2007.
42 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool