Secure network coding on a wiretap network

IEEE Transactions on Information Theory

Volumn 57, Issue 1, 2011, Pages 424-435

  Cai, Ning ^a,b   Yeung, Raymond W ^a  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^b XIDIAN UNIVERSITY   (China)

Author keywords

Algebraic coding; cryptography; multicast; network coding; secret sharing; wiretap channel

Indexed keywords

ALGEBRAIC CODING; MULTICASTS; NETWORK CODING; SECRET SHARING; WIRETAP CHANNEL;

ALGEBRA; CRYPTOGRAPHY; GRAPH THEORY; INFORMATION THEORY; MULTICASTING; OPTIMAL SYSTEMS; SECURITY OF DATA;

ENCODING (SYMBOLS);

EID: 78650893906     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2010.2090197     Document Type: Article

References (32)

1. R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, "Network information flow," IEEE Trans. Inf. Theory, vol. IT-46, pp. 1204-1216, 2000.
2. K. Bhattad and K. R. Narayanan, "Weakly secure network coding," in Proc. First Workshop on Network Coding, Theory, Appl. (NetCod'05), Apr. 2005.
3. G. R. Blakley, "Safeguarding cryptographic keys," in Proc. Nat. Comput. Conf., 1979, vol. 48, pp. 313-317.
4. N. Cai, "Valuable messages and random outputs of channels in linear network coding," presented at the IEEE Int. Symp. Inf. Theory 2009, Seoul, Korea, Jun. 28-Jul. 3, 2009.
5. N. Cai and R. W. Yeung, "Secure network coding," presented at the IEEE Int. Symp. Inf. Theory, Lausanne, Switzerland, Jun. 30-Jul. 5, 2002.
6. N. Cai and R. W. Yeung, "A security condition for multi-source linear network coding," presented at the IEEE Int. Symp. Inf. Theory, Nice, France, Jun. 24-29, 2007.
7. N. Cai and R. W. Yeung, "Network error correction, Part II: Lower bounds," Commun. Inf. Syst., vol. 6, pp. 37-54, 2006.
8. T. Chan and A. Grant, "Capacity bounds for secure network coding," presented at the Austral. Commun. Theory Workshop, Christchurch, New Zealand, Jan. 30-Feb. 1, 2008.
9. T. M. Cover and J. A. Thomas, Elements of Information Theory, 2nd ed. Hoboken, NJ: Wiley, 2006.
10. S. Y. El Rouayheb and E. Soljanin, "On wiretap networks II," presented at the IEEE Int. Symp. Inf. Theory, Nice, France, Jun. 24-29, 2007.
11. J. Feldman, T. Malkin, C. Stein, and R. A. Servedio, "On the capacity of secure network coding," presented at the 42nd Ann. Allerton Conf. Commun., Contr., Comput., Monticello, IL, Sep. 29-Oct. 1, 2004.
12. L. K. Ford Jr. and D. K. Fulkerson, Flows in Networks. Princeton, NJ: Princeton Univ. Press, 1962.
13. T. S. Han, "Nonnegative entropy measures of multivariate symmetric correlations," Inf. Contr., vol. 36, pp. 133-156, 1978.
14. K. Harada and H. Yamamoto, "Strongly secure linear network coding," EICE Trans. Fundament., vol. E91-A, no. 10, pp. 2720-2728, Oct. 2008.
15. T. Ho, M. Médard, R. Koetter, D. Karger, M. Effros, J. Shi, and B. Leong, "A random linear network coding approach to multicast," IEEE Trans. Inf. Theory, vol. 52, pp. 4413-4430, Oct. 2006. (Pubitemid 46445282)
16. S. Jaggi, P. Sanders, P. A. Chou, M. Effros, S. Egner, K. Jain, and L. Tolhuizen, "Polynomial time algorithms for multicast network code construction," IEEE Trans. Inf. Theory, vol. IT-51, pp. 1973-1982, 2005.
17. K. Jain, "Security based on network topology against the wiretapping attack," IEEE Wireless Commun., pp. 68-71, Feb. 2004.
18. S.-Y. R. Li, R. W. Yeung, and N. Cai, "Linear network coding," IEEE Trans. Inf. Theory, vol. 49, pp. 371-381, 2003.
19. L. Lima, M. Médard, and J. Barros, "Random linear network coding: A free cipher?," presented at the IEEE Int. Symp. Inf. Theory, Nice, France, Jun. 24-29, 2007.
20. C.-K. Ngai, R. W. Yeung, and Z. Zhang, "Network generalized Hamming weight," presented at the 2009 Workshop on Network Coding, Theory Appl., Lausanne, Switzerland, 2009.
21. C.-K. Ngai and R. W. Yeung, "Secure error-correcting (SEC) network codes," presented at the 2009 Workshop on Network Coding, Theory and Appl., Lausanne, Switzerland, 2009.
22. L. H. Ozarowand A. D.Wyner, "Wire-tap channel II," AT&T Bell Labs. Tech. J., vol. 63, pp. 2135-2157, 1984.
23. J. Tan and M. Médard, "Secure network coding with a cost criterion," presented at the 2ndWorkshop on Network Coding, Theory and Appl., Boston, MA, Apr. 2006.
24. A. Shamir, "How to share a secret," Commun. ACM, vol. 22, pp. 612-613, 1979.
25. C. E. Shannon, "Communication theory of secrecy systems," Bell Sys. Tech. J., vol. 28, pp. 656-715, 1949.
26. V. K. Wei, "Generalized Hamming weight for linear codes," IEEE Trans. Inf. Theory, vol. 37, pp. 1412-1418, Sep. 1991.
27. R. W. Yeung, A First Course in Information Theory. Boston, MA: Kluwer, 2002.
28. R. W. Yeung, Information Theory and Network Coding. New York: Springer, 2008.
29. R. W. Yeung and N. Cai, "Network error correction, Part I: Basic concepts and upper bounds," Commun. Inf. Syst., vol. 6, pp. 19-36, 2006.
30. R. W. Yeung and N. Cai, "On the optimality of a construction of secure network codes," presented at the IEEE Int. Symp. Inf. Theory, Toronto, ON, Canada, Jul. 6-11, 2008.
31. R. W. Yeung, S.-Y. R. Li, N. Cai, and Z. Zhang, "Network coding theory," Found. Trends in Commun. Inf. Theory, vol. 2, no. 4 and 5, pp. 241-381, 2005.
32. Z. Zhang and R. W. Yeung, "A general security condition for multisource linear network coding," presented at the IEEE Int. Symp. Inf. Theory, Seoul, Korea, Jun. 28-Jul. 3, 2009.