Optimal linear network coding design for secure unicast with multiple streams

Proceedings - IEEE INFOCOM

Volumn , Issue , 2010, Pages

  Wang, Jin ^a,b   Wang, Jianping ^b   Lu, Kejie ^c   Xiao, Bin ^d   Gu, Naijie ^a  

^a UNIVERSITY OF SCIENCE AND TECHNOLOGY OF CHINA   (China)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^c UNIVERSITY OF PUERTO RICO   (Puerto Rico)

^d HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

Author keywords

Network coding; Throughput capacity; Weakly secure

Indexed keywords

COMMUNICATION NETWORKS; EFFICIENT ALGORITHM; LINEAR NETWORK CODING; LINK-DISJOINT PATHS; LOW BOUND; MULTIPLE STREAMS; NETWORK CODING; RANDOM LINEAR CODES; SALIENT FEATURES; SOURCE NODES; THROUGHPUT CAPACITIES; TRANSMISSION DATA RATE; UNICAST; UNICAST ROUTING;

ALGORITHMS; DESIGN; INFORMATION THEORY; LINEAR NETWORKS; OPTIMIZATION; THROUGHPUT; TOPOLOGY;

ENCODING (SYMBOLS);

EID: 77953316768     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2010.5462049     Document Type: Conference Paper

References (16)

1. R. Ahlswede, N. Cai, S. Li, and R. Yeung, "Network information flow," IEEE Transactions on Information Theory, vol. 46, no. 4, pp. 1204-1216, 2000.
2. S. Li, R. Yeung, and N. Cai, "Linear network coding," IEEE Transactions on Information Theory, vol. 49, no. 2, pp. 371-381, 2003.
3. T. Ho, B. Leong, R. Koetter, M. Medard, M. Effros, and D. Karger, "Byzantine modification detection in multicast networks using randomized network coding," in Proceedings of IEEE International Symposium on Information Theory (ISIT) 2004, 2004, p. 144.
4. M. Krohn, M. Freedman, and D. Mazieres, "On-the-fly verification of rateless erasure codes for efficient content distribution," in Proceedings of IEEE Symposium on Security and Privacy 2004, 2004, pp. 226-240.
5. C. Gkantsidis and P. R. Rodriguez, "Cooperative security for network coding file distribution," in Proceedings of INFOCOM 2006, the 25th IEEE International Conference on Computer Communications, 2006, pp. 1-13.
6. S. Jaggi, M. Langberg, S. Katti, T. Ho, D. Katabi, and M. Medard, "Resilient network coding in the presence of byzantine adversaries," in Proceedings of IEEE INFOCOM 2007, the 26th Conference on Computer Communications, 2007, pp. 616-624.
7. Z. Yu, Y. Wei, B. Ramkumar, and Y. Guan, "An efficient Signature-Based scheme for securing network coding against pollution attacks," in Proceedings of IEEE INFOCOM 2008, the 27th Conference on Computer Communications, 2008, pp. 1409-1417.
8. N. Cai and R. Yeung, "Secure network coding," in Proceedings of IEEE International Symposium on Information Theory (ISIT) 2002, 2002, p. 323.
9. J. Feldman, T. Malkin, C. Stein, and R. A. Servedio, "On the capacity of secure network coding," in Proceedings of the 42nd Annual Allerton Conference on Communication, Control, and Computing, 2004.
10. K. Bhattad and K. R. Narayanan, "Weakly secure network coding," in Proceedings of the First Workshop on Network Coding, Theory, and Applications(NetCod), Riva del Garda, Italy, 2005.
11. L. Lima, M. Medard, and J. ao Barros, "Random linear network coding: A free cipher?" in Proceedings of IEEE International Symposium on Information Theory (ISIT) 2007, 2007, pp. 546-550.
12. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Feb. 1993.
13. T. Ho, R. Koetter, M. Medard, D. Karger, and M. Effros, "The benefits of coding over routing in a randomized setting," in Proceedings of IEEE International Symposium on Information Theory (ISIT) 2003, 2003, p. 442.
14. T. Ho, M. Medard, J. Shi, M. Effros, and D. R. Karger, "On randomized network coding," in Proceedings of the 41st Annual Allerton Conference on Communication Control and Computing, vol. 41. The University; 1998, 2003, pp. 11-20.
15. K. Jain, "Security based on network topology against the wiretapping attack," IEEE Wireless Communications, vol. 11, no. 1, pp. 68-71, 2004.
16. S. Jaggi, P. Chou, and K. Jain, "Low complexity algebraic multicast network codes," in Proceedings of IEEE International Symposium on Information Theory (ISIT) 2003, 2003, p. 368.