\input zb-basic
\input zb-ioport
\iteman{io-port 06102512}
\itemau{Tang, Zhaohui; Lim, Hoon Wei; Wang, Huaxiong}
\itemti{Revisiting a secret sharing approach to network codes.}
\itemso{Takagi, Tsuyoshi (ed.) et al., Provable security. 6th international conference, ProvSec 2012, Chengdu, China, September 26--28, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-33271-5/pbk). Lecture Notes in Computer Science 7496, 300-317 (2012).}
\itemab
Summary: Secret sharing has been used in multicast network coding to transmit information securely in the presence of a wiretapper who is capable of eavesdropping a bounded number of network edges. Typically information-theoretic security against the wiretapper can be achieved when multicasting a message by concatenating it with some random symbols and representing them with a carefully chosen network code. In this paper, we revisit a secret sharing approach to network codes. Particularly, we are concerned with whether or not a given network code is secure. We derive a necessary and sufficient condition for a given network code to be secure for a network coding instance. In comparison with previous work, our condition is more explicit in the sense that it is easier to verify. Furthermore, we devise a precise algorithm to transform an insecure network code into a secure one. Our algorithm achieves smaller secure code alphabet size over previous work.
\itemrv{~}
\itemcc{}
\itemut{network coding; secret sharing; information-theoretic security}
\itemli{doi:10.1007/978-3-642-33272-2\_20}
\end