On the security of index coding with side information

IEEE Transactions on Information Theory

Volumn 58, Issue 6, 2012, Pages 3975-3988

  Dau, Son Hoang ^a   Skachek, Vitaly ^b   Chee, Yeow Meng ^a  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^b MCGILL UNIVERSITY   (Canada)

Author keywords

Index coding; network coding; side information; strong security; weak security

Indexed keywords

CODING WITH SIDE INFORMATION; COLUMN SPACE; DUAL DISTANCE; INDEX CODING; MINIMUM DISTANCE; SIDE INFORMATION; STRONG SECURITY; WEAK SECURITY;

NETWORK CODING;

OPTIMAL SYSTEMS;

EID: 84861355529     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2012.2188777     Document Type: Conference Paper

References (32)

1. Y. Birk and T. Kol, "Informed-source coding-on-demand (ISCOD) over broadcast channels," in Proc. IEEE Conf. Comput. Commun., San Francisco, CA, 1998, pp. 1257-1264.
2. Y. Birk and T. Kol, "Coding-on-demand by an informed source (ISCOD) for efficient broadcast of different supplemental data to caching clients," IEEE Trans. Inf. Theory, vol. 52, no. 6, pp. 2825-2830, Jun. 2006.
3. A. E. Rouayheb, A. Sprintson, and C. Georghiades, "On the index coding problem and its relation to network coding and matroid theory," IEEE Trans. Inf. Theory, vol. 56, no. 7, pp. 3187-3195, Jul. 2010.
4. S. Katti, H. Rahul, W. Hu, D. Katabi, M. Médard, and J. Crowcroft, "Xors in the air: Practical wireless network coding," in Proc. ACM SIGCOMM, 2006, pp. 243-254.
5. S. Katti, D. Katabi, H. Balakrishnan, and M. Médard, "Symbol-level network coding for wireless mesh networks," ACM SIGCOMM Comput. Commun. Rev., vol. 38, no. 4, pp. 401-412, 2008.
6. Z. Bar-Yossef, Z. Birk, T. S. Jayram, and T. Kol, "Index coding with side information," in Proc. 47th Annu. IEEE Symp. Found. Comput. Sci., 2006, pp. 197-206.
7. E. Lubetzky and U. Stav, "Non-linear index coding outperforming the linear optimum," in Proc. 48th Annu. IEEE Symp. Found. Comput. Sci., 2007, pp. 161-168.
8. J. P. Y. Wu, R. Chandra, V. Padmanabhan, and P. A. Chou, "The local mixing problem," presented at the presented at the Inf. Theory Appl. Workshop, San Diego, CA, 2006.
9. S. E. Rouayheb, M. A. R. Chaudhry, and A. Sprintson, "On the minimum number of transmissions in single-hop wireless coding networks," in Proc. IEEE Inf. Theory Workshop, 2007, pp. 120-125.
10. A. E. Rouayheb, A. Sprintson, and C. Georghiades, "On the relation between the index coding and the network coding problems," in Proc. IEEE Symp. Inf. Theory, Toronto, Canada, 2008, pp. 1823-1827.
11. M. A. R. Chaudhry and A. Sprintson, "Efficient algorithms for index coding," in Proc. IEEE Conf. Comput. Commun., 2008, pp. 1-4.
12. N. Alon, A. Hassidim, E. Lubetzky, U. Stav, and A. Weinstein, "Broadcasting with side information," in Proc. 49th Annu. IEEE Symp. Found. Comput. Sci., 2008, pp. 823-832.
13. R. Ahlswede, N. Cai, S. Y. R. Li, and R. W. Yeung, "Network information flow," IEEE Trans. Inf. Theory, vol. 46, no. 4, pp. 1204-1216, Jul. 2000.
14. R. Koetter and M. Médard, "An algebraic approach to network coding," IEEE/ACM Trans. Netw., vol. 11, no. 5, pp. 782-795, Oct. 2003.
15. R. Peeters, "Orthogonal representations over finite fields and the chromatic number of graphs," Combinatorica, vol. 16, no. 3, pp. 417-431, 1996.
16. J. L. Massey, "Minimal codewords and secret sharing," in Proc. Joint Swedish-Russian Int. Workshop Inf. Theory, 1993, pp. 276-279.
17. C. Ding, R. Laihonen, and A. Renvall, "Linear multisecret-sharing schemes and error-correcting codes," J. Universal Comput. Sci., vol. 3, no. 9, pp. 1023-1036, 1997.
18. N. Cai and R. W. Yeung, "Secure network coding," in Proc. IEEE Symp. Inf. Theory, Lausanne, Switzerland, 2002, pp. 551-555.
19. J. Feldman, T. Malkin, R. A. Servedio, and C. Stein, "On the capacity of secure network coding," in Proc. Annu. Allerton Conf. Commun., Control, Comput., 2004.
20. A. E. Rouayheb and E. Soljanin, "On wiretap networks II," in Proc. IEEE Symp. Inf. Theory, Nice, France, 2007, pp. 551-555.
21. Z. Zhuang, Y. Luo, and A. J. H. Vinck, "Secure error-correcting network codes with side information from source," in Proc. Int. Conf. Commun. Intell. Inf. Security, 2010, pp. 55-59.
22. D. Silva and F. R. Kschischang, "Universal secure error-correcting schemes for network coding," in Proc. IEEE Symp. Inf. Theory, Austin, TX, 2010, pp. 2428-2432.
23. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam, The Netherlands: North-Holland, 1977.
24. A. S. Hedayat, N. J. A. Sloane, and J. Stufken, Orthogonal Arrays: Theory and Applications. New York: Springer-Verlag, 1999.
25. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley-Interscience, 1991.
26. W. Haemers, "An upper bound for the Shannon capacity of a graph," Algebr. Methods Graph Theory, vol. 25, pp. 267-272, 1978.
27. K. Bhattad and K. R. Narayanan, "Weakly secure network coding," in Proc. 1st Workshop Netw. Coding, Theory, Appl., 2005.
28. D. Silva and F. R. Kschischang, "Universal weakly secure network coding," in Proc. Inf. Theory Workshop Netw. Inf. Theory, 2009, pp. 281-285.
29. R. Roth, Introduction to Coding Theory. Cambridge, U. K.: Cambridge Univ. Press, 2006.
30. S. H. Dau, V. Skachek, and Y. M. Chee, Index coding and error correction, 2011 [Online]. Available: http://arxiv. org/abs/1101. 2728
31. L. H. Ozarow and A. D. Wyner, "The wire-tap channel II," Bell Syst. Tech. J., vol. 63, pp. 2135-2157, 1984.
32. A. Vardy, "The intractability of computing the minimum distance of a code," IEEE Trans. Inf. Theory, vol. 43, no. 6, pp. 1757-1766, Nov. 1997.