@inproceedings{eedf53ce8ba2445bbdf821419cc2d740,
title = "Revisiting a secret sharing approach to network codes",
abstract = "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.",
keywords = "network coding, secret sharing, information-theoretic security",
author = "Zhaohui Tang and Lim, {Hoon Wei} and Huaxiong Wang",
year = "2012",
doi = "10.1007/978-3-642-33272-2_20",
language = "English",
isbn = "9783642332715",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer, Springer Nature",
pages = "300--317",
editor = "Tsuyoshi Takagi and Guilin Wang and Zhiguang Qin and Shaoquan Jiang and Yong Yu",
booktitle = "Provable Security",
address = "United States",
note = "6th International Conference on Provable Security, ProvSec 2012 ; Conference date: 26-09-2012 Through 28-09-2012",
}