Universal weakly secure network coding

Proceedings - 2009 IEEE Information Theory Workshop on Networking and Information Theory, ITW 2009

Volumn , Issue , 2009, Pages 281-285

  Silva, Danilo ^a   Kschischang, Frank R ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

FIELD SIZE; JOINT DESIGNS; LINEAR NETWORK CODING; NETWORK CODES; RANDOM NETWORK CODING; SECURE NETWORKS; SECURITY REQUIREMENTS; SECURITY SCHEME; UNDERLYING NETWORKS; UNIVERSAL APPROACH;

TECHNICAL PRESENTATIONS;

INFORMATION THEORY;

EID: 77950676424     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITWNIT.2009.5158587     Document Type: Conference Paper

References (12)

1. L. H. Ozarow and A. D. Wyner, "Wire-tap channel II," in Proc. EUROCRYPT 84 workshop on Advances in cryptology: theory and applicationof cryptographic techniques. New York, NY, USA: Springer-Verlag New York, Inc., 1985, pp. 33-51.
2. 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.
3. S.-Y. R. Li, R. W. Yeung, and N. Cai, "Linear network coding," IEEE Trans. Inf. Theory, vol. 49, no. 2, pp. 371-381, Feb. 2003.
4. 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.
5. N. Cai and R. W. Yeung, "Secure network coding," in Proc. IEEE Int. Symp. Information Theory, Lausanne, Switzerland, Jun. 30-Jul. 5, 2002, p. 323.
6. J. Feldman, T. Malkin, C. Stein, and R. A. Servedio, "On the capacity of secure network coding," in Proc. 42nd Annual Allerton Conf. on Commun., Control, and Computing, Sep. 2004.
7. S. Y. E. Rouayheb and E. Soljanin, "On wiretap networks II," in Proc. IEEE Int. Symp. Information Theory, Nice, France, Jun. 24-29, 2007, pp. 551-555.
8. D. Silva and F. R. Kschischang, "Security for wiretap networks via rankmetric codes," in Proc. IEEE Int. Symp. Information Theory, Toronto, Canada, Jul. 6-11, 2008, pp. 176-180.
9. K. Bhattad and K. R. Narayanan, "Weakly secure network coding," in Proc. NetCod 2005, Riva del Garda, Italy, Apr. 2005.
10. E. M. Gabidulin, "Theory of codes with maximum rank distance," Probl. Inform. Transm., vol. 21, no. 1, pp. 1-12, 1985.
11. D. Silva, F. R. Kschischang, and R. Kötter, "A rank-metric approach to error control in random network coding," IEEE Trans. Inf. Theory, vol. 54, no. 9, pp. 3951-3967, 2008.
12. D. Silva and F. R. Kschischang, "Universal secure network coding via rank-metric codes," 2008, submitted for publication. [Online]. Available: http://arxiv.org/abs/0809.3546.