The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.10 - Oct. (2013 vol.24)
pp: 2025-2035
Jin Wang , Soochow University, Suzhou
Jianping Wang , City University of Hong Kong, Kong Kong
Kejie Lu , University of Puerto Rico at Mayagüez, Mayagüez
Bin Xiao , Hong Kong Polytechnic University, Hong Kong
Naijie Gu , University of Science and Technology of China, Hefei
ABSTRACT
In this paper, we will address the modeling and optimal design of linear network coding (LNC) for secure unicast with multiple streams between the same source and destination pair. The objectives include 1) satisfying the weakly secure requirements, 2) maximizing the transmission data rate, and 3) minimizing the size of the finite field. To fulfill the first two objectives, we formulate a secure unicast routing problem and prove that it is equivalent to a constrained link-disjoint path problem. Based on this fact, we develop an efficient algorithm that can find the optimal unicast topology in a polynomial amount of time. With the given topology, we investigate the design of both weakly secure deterministic LNC and weakly secure random LNC. In the designs of deterministic LNC and random LNC, we prove that the required size of the finite field decreases with the decrease of the number of intermediate nodes in the topology. Therefore, to meet the third objective, we formulate a problem to minimize the number of intermediate nodes. We prove that this problem is NP-Complete and develop an approximation algorithm to solve it. Finally, extensive simulation experiments have been conducted, and the results demonstrate the effectiveness of the proposed algorithms.
INDEX TERMS
Unicast, Topology, Routing, Network topology, Network coding, Vectors, Encoding, finite field, Secure linear network coding, deterministic linear network coding, random linear network coding, passive attack, unicast
CITATION
Jin Wang, Jianping Wang, Kejie Lu, Bin Xiao, Naijie Gu, "Modeling and Optimal Design of Linear Network Coding for Secure Unicast with Multiple Streams", IEEE Transactions on Parallel & Distributed Systems, vol.24, no. 10, pp. 2025-2035, Oct. 2013, doi:10.1109/TPDS.2012.265
REFERENCES
[1] R. Ahlswede, N. Cai, S.-Y. Li, and R. Yeung, "Network Information Flow," IEEE Trans. Information Theory, vol. 46, no. 4, pp. 1204-1216, July 2000.
[2] R. Koetter and M. Medard, "An Algebraic Approach to Network Coding," IEEE/ACM Trans. Networking, vol. 11, no. 5, pp. 782-795, Oct. 2003.
[3] S.-Y.R. Li, R.W. Yeung, and N. Cai, "Linear Network Coding," IEEE Trans. Information Theory, vol. 49, no. 2, pp. 371-381, Feb. 2003.
[4] T. Ho, B. Leong, R. Koetter, M. Medard, M. Effros, and D. Karger, "Byzantine Modification Detection in Multicast Networks Using Randomized Network Coding," Proc. IEEE Int'l Symp. Information Theory, p. 144, 2004.
[5] M. Kim, L. Lima, F. Zhao, J. Barros, M. Medard, R. Koetter, T. Kalker, and K.J. Han, "On Counteracting Byzantine Attacks in Network Coded Peer-to-Peer Networks," IEEE J. Selected Areas in Comm., vol. 28, no. 5, pp. 692-702, June 2010.
[6] S. Jaggi, M. Langberg, S. Katti, T. Ho, D. Katabi, and M. Medard, "Resilient Network Coding in the Presence of Byzantine Adversaries," Proc. ACM INFOCOM, pp. 616-624, 2007.
[7] N. Cai and R. Yeung, "Secure Network Coding," Proc. IEEE Int'l Symp. Information Theory, p. 323, 2002.
[8] J. Feldman, T. Malkin, C. Stein, and R.A. Servedio, "On the Capacity of Secure Network Coding," Proc. 42nd Ann. Allerton Conf. Comm., Control, and Computing, 2004.
[9] K. Bhattad and K.R. Narayanan, "Weakly Secure Network Coding," Proc. First Workshop Network Coding, Theory, and Applications (NetCod), 2005.
[10] L. Lima, M. Medard, and J. Barros, "Random Linear Network Coding: A Free Cipher?" Proc. IEEE Int'l Symp. Information Theory (ISIT), pp. 546-550, 2007.
[11] R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Feb. 1993.
[12] T. Ho, R. Koetter, M. Medard, D. Karger, and M. Effros, "The Benefits of Coding over Routing in a Randomized Setting," Proc. IEEE Int'l Symp. Information Theory (ISIT), p. 442, 2003.
[13] T. Ho, M. Medard, J. Shi, M. Effros, and D.R. Karger, "On Randomized Network Coding," Proc. 41st Ann. Allerton Conf. Comm. Control and Computing, vol. 41, pp. 11-20, 2003.
[14] Y. Wei, Z. Yu, and Y. Guan, "Efficient Weakly-Secure Network Coding Schemes against Wiretapping Attacks," Proc. IEEE Int'l Symp. Network Coding, pp. 1-6, 2010.
[15] D. Silva and F. Kschischang, "Universal Weakly Secure Network Coding," Proc. IEEE Information Theory Workshop Networking and Information Theory (ITW), pp. 281-285, 2009.
[16] K. Jain, "Security Based on Network Topology against the Wiretapping Attack," IEEE Wireless Comm., vol. 11, no. 1, pp. 68-71, Feb. 2004.
[17] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., 1990.
[18] U. Feige, "A Threshold of ln n for Approximating Set Cover," J. ACM, vol. 45, no. 4, pp. 634-652, 1998.
6 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool