Strongly secure linear network coding

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E91-A, Issue 10, 2008, Pages 2720-2728

  Harada, Kunihiko ^a   Yamamoto, Hirosuke ^a  

^a UNIVERSITY OF TOKYO   (Japan)

Author keywords

Linear network coding; Network coding; Secret sharing schemes; Secure network coding; Strong ramp secret sharing schemes

Indexed keywords

CODES (SYMBOLS); LINEAR NETWORKS; NETWORK CODING;

A-TRANSFORM; ALPHABET SIZE; SECRET INFORMATION; SECRET SHARING SCHEMES; SECURE NETWORK CODING; SECURE NETWORKS; SINK NODES; SOURCE NODES;

NETWORK SECURITY;

EID: 70449482308     PISSN: 09168508     EISSN: 17451337     Source Type: Journal    
DOI: 10.1093/ietfec/e91-a.10.2720     Document Type: Article

References (15)

1. 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, July 2000.
2. 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.
3. N. Cai and R.W. Yeung, "Secure network coding," IEEE ISIT02, p.323, June 2002.
4. J. Feldman, T. Malkin, C. Stein, and R.A. Servedio, "On the capacity of secure network coding," 42nd Ann. Allerton Conf. on Comm., Control, and Comp., 2004.
5. H. Yamamoto, "Secret sharing system using (k,L,n) threshold scheme," IECE Trans. Fundamentals (Japanese Edition), vol.J68-A, no.9, pp.945-952, Sept. 1985. (English Translation: Scripta Tech-nica, Inc., Electronics and Comm. in Japan, Part 1, vol.69, no.9, pp.46-54, 1986.)
6. G.R. Blakley and C. Meadows, "Security of ramp schemes," Advances in Cryptology-CRYPTO'84, LNCS 196, pp.242-269, Springer-Verlag, 1985.
7. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network Flows: Theory, Algorithms, and Applications, Englewood Cliifs, NJ, Prentice-Hall, 1993.
8. T. Ho, R. Koetter, and M. M'edard, "Network coding from a network flow perspective," IEEE ISIT03, Yokohama, Japan,p.442, 2003.
9. S. Jaggi, P. Sanders, C.P.A., and L. Tolhuizen,"Polynomial time algorithms for multicast network code construction," IEEE Trans. Inf. Theory, vol.51, no.6, pp. 1973-1982, June 2005.
10. T. Ho, R. Koetter, M. Medard, D. Karger, and M. Effros, "The benefits of coding over routing in a randomized setting," IEEE ISIT'03, p.441, 2003.
11. S. Jaggi, PA. Chou, and J.K., "Low complexity algebraic multicast network codes," IEEE ISIT'03, p.441, 2003.
12. P. Sanders, S. Egner, and L. Tolhuizen, "Polynomial time algorithms for network information flow," 15th ACM Symp. Parallel Alg. and Arch., pp.286-294, June 2003.
13. K. Bhattad and K.R. Narayanan, "Weakly secure network coding," NetCod 2005, 2005.
14. A. Schrijver, Combinatorial Optimization: Algorithms and Combinatorics, Springer Velag, 2003.
15. W.C. Huffman and V. Pless, Fundamentals of Error Correcting Codes, Cambridge University Press, 2003.