The Community for Technology Leaders
RSS Icon
Issue No.02 - March/April (2012 vol.9)
pp: 211-221
John C.S. Lui , The Chinese University of Hong Kong, Hong Kong
Qiming Li , Institute for Infocomm Research Institute, Singapore
Content distribution via network coding has received a lot of attention lately. However, direct application of network coding may be insecure. In particular, attackers can inject "bogus” data to corrupt the content distribution process so as to hinder the information dispersal or even deplete the network resource. Therefore, content verification is an important and practical issue when network coding is employed. When random linear network coding is used, it is infeasible for the source of the content to sign all the data, and hence, the traditional "hash-and-sign” methods are no longer applicable. Recently, a new on-the-fly verification technique has been proposed by Krohn et al. (IEEE S&P '04), which employs a classical homomorphic hash function. However, this technique is difficult to be applied to network coding because of high computational and communication overhead. We explore this issue further by carefully analyzing different types of overhead, and propose methods to help reducing both the computational and communication cost, and provide provable security at the same time.
Content distribution, security, verification, network coding.
John C.S. Lui, Qiming Li, "On the Security and Efficiency of Content Distribution via Network Coding", IEEE Transactions on Dependable and Secure Computing, vol.9, no. 2, pp. 211-221, March/April 2012, doi:10.1109/TDSC.2011.32
[1] S. Acedanski, S. Deb, M. Medard, and R. Koetter, “How Good Is Random Linear Coding Based Distributed Networked Storage,” Proc. Workshop Network Coding, Theory and Applications, Apr. 2005.
[2] P.A. Chou, Y. Wu, and K. Jain, “Practical Network Coding,” Proc. Allerton Conf. Comm., Control, and Computing, Oct. 2003.
[3] C. Gkantsidis and P.R. Rodriguez, “Network Coding for Large Scale Content Distribution,” Proc. IEEE INFOCOM, pp. 2235-2245, 2005.
[4] M. Wang, Z. Li, and B. Li, “A High-Throughput Overlay Multicast Infrastructure with Network Coding,” Proc. Int'l Workshop Quality of Service (IWQoS), 2005.
[5] Y. Zhu, B. Li, and J. Guo, “Multicast with Network Coding in Application-Layer Overlay Networks,” IEEE J. Selected Areas in Comm., vol. 22, no. 1, pp. 107-120, Jan. 2004.
[6] 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.
[7] S.R. Li, R.W. Yeung, and N. Cai, “Linear Network Coding,” IEEE Trans. Information Theory, vol. 49, no. 2, pp. 371-381, Feb. 2003.
[8] R. Koetter and M. Médard, “An Algebraic Approach to Network Coding,” IEEE/ACM Trans. Networking, vol. 11, no. 5, pp. 782-795, Oct. 2003.
[9] S. Jaggi, P. Sanders, P.A. Chou, M. Effros, S. Egner, K. Jain, and L.M. Tolhuizen, “Polynomial Time Algorithms for Multicast Network Code Construction,” IEEE Trans. Information Theory, vol. 51, no. 6, pp. 1973-1982, June 2005.
[10] C. Gkantsidis and P. Rodriguez, “Cooperative Security for Network Coding File Distribution,” technical report, Microsoft Research, 2004.
[11] T. Ho, B. Leong, R. Koetter, M. Médard, M. Effros, and D.R. Karger, “Byzantine Modification Detection in Multicast Networks Using Randomized Network Coding,” Proc. IEEE Int'l Symp. Information Theory, 2004.
[12] C. Gkantsidis, J. Miller, and P. Rodriguez, “Anatomy of a P2P Content Distribution System with Network Coding,” Proc. Int'l Workshop Peer-to-Peer Systems, Feb. 2006.
[13] T. Ho, R. Koetter, M. Médard, D.R. Karger, and M. Effros, “The Benefits of Coding over Routing in a Randomized Setting,” Proc. IEEE Int'l Symp. Information Theory, 2003.
[14] M.N. Krohn, M.J. Freedman, and D. Mazières, “On-the-Fly Verification of Rateless Erasure Codes for Efficient Content Distribution,” Proc. IEEE Symp. Security and Privacy, pp. 226-240, May 2004.
[15] M. Bellare, O. Goldreich, and S. Goldwasser, “Incremental Cryptography: The Case of Hashing and Signing,” Proc. CRYPTO, 1994.
[16] C. Gkantsidis and P. Rodriguez, “Cooperative Security for Network Coding File Distribution,” Proc. IEEE INFOCOM, pp. 1-13, Apr. 2006.
[17] S. Contini, A.K. Lenstra, and R. Steinfeld, “VSH, an Efficient and Provable Collision-Resistant Hash Function,” Proc. EUROCRYPT, pp. 165-182, 2006.
[18] R. Koetter and M. Médard, “Beyond Routing: An Algebraic Approach to Network Coding,” Proc. IEEE INFOCOM, pp. 122-130, 2002.
[19] J. Edmonds, “Minimum Partition of a Matroid into Independent Sets,” J. Research of the Nat'l Bureau of Standards, vol. 869, pp. 67-72, 1965.
[20] B. Fan, J.C.S. Lui, and D.-M. Chiu, “The Design Trade-Offs of BitTorrent-Like File Sharing Protocols,” IEEE/ACM Trans. Networking, vol. 17, no. 2, pp. 365-376, Apr. 2009.
[21] R.T.B. Ma, S.C.M. Lee, J.C.S. Lui, and D.K.Y. Yau, “Incentive and Service Differentiation in P2P Networks: A Game Theoretic Approach,” IEEE/ACM Trans. Networking, vol. 14, no. 5, pp. 978-991, Oct. 2006.
[22] M. Bellare, J. Garay, and T. Rabin, “Fast Batch Verification for Modular Exponentiation and Digital Signatures,” Proc. EUROCRYPT, 1998.
[23] J. Le, J.C. Lui, and D.-M. Chiu, “On the Performance Bounds of Practical Wireless Network Coding,” IEEE Trans. Mobile Computing, vol. 9, no. 8 pp. 1134-1146, Aug. 2010.
[24] J. Le, J.C.S. Lui, and D.-M. Chiu, “DCAR: Distributed Coding-Aware Routing in Wireless Networks,” IEEE Trans. Mobile Computing, vol. 9, no. 4, pp. 596-608, Apr. 2010.
16 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool