EngineeringCommunicationComputer ScienceComputer NetworksInformation TheoryNetwork SecurityChannel CodingInformation-theoretic SecurityNetwork Information TheoryCommunication SecurityInformation-theoretic Secrecy CapacitySecure Data TransmissionSecure Network CodingSecure Transmission DesignWeak SecrecyWiretap Channels
The Cai and Yeung wiretap network model, where the eavesdropper receives no source information, is a special case of the proposed framework. The authors address secure data transmission on acyclic multicast networks by proposing an information‑theoretic security model that deems a system secure when an eavesdropper cannot obtain any meaningful source information. The approach assumes the eavesdropper has fewer independent messages than the network’s multicast capacity, and introduces a source‑only linear transformation that, applied to any existing linear code, secures the system while leaving intermediate node operations unchanged. The study demonstrates that the new security model allows communication at full multicast capacity, and that using random coding over a sufficiently large field can make the system secure with probability arbitrarily close to one.
In this work we consider the problem of secure data transmission on an acyclic multicast network. A new information theoretic model for security is proposed that defines the system as secure if an eavesdropper is unable to get any “meaningful” information about the source. The “wiretap” network model by Cai and Yeung in which no information of the source is made available to the eavesdropper is a special case in the new model. We consider the case when the number of independent messages available to the eavesdropper is less than the multicast capacity of the network. We show that under the new security requirements communication is possible at the multicast capacity. A linear transformation is provided for networks with a given linear code to make the system secure. The transformation needs to be done only at the source and the operations at the intermediate nodes remain unchanged. We also show that if random coding scheme is used the probability of the system being secure can be made arbitrarily close to one by coding over a large enough field.
8
Rudolf Ahlswede, Ning Cai, Shuo Li et al. · IEEE Transactions on Information Theory · 2000 · 7.9K citations
Shuo Li, Raymond W. Yeung, Ning Cai · IEEE Transactions on Information Theory · 2003 · 3.5K citations
A Random Linear Network Coding Approach to Multicast
T. Ho, Muriel Médard, R. Koetter et al. · IEEE Transactions on Information Theory · 2006 · 2.6K citations
Tracey Ho, Muriel Médard, Jun Shi et al. · 2003 · 534 citations
Ning Cai, Raymond W. Yeung · 2003 · 458 citations