An algebraic approach to network coding
IEEE/ACM Transactions on Networking (TON)
Information Theory and Network Coding
Information Theory and Network Coding
IEEE Transactions on Information Theory
Polynomial time algorithms for multicast network code construction
IEEE Transactions on Information Theory
Byzantine Modification Detection in Multicast Networks With Random Network Coding
IEEE Transactions on Information Theory
Resilient Network Coding in the Presence of Byzantine Adversaries
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
Note that network coding allows immediate nodes to mix information from different data flows. On the basis of this observation, we prove that under suitable conditions, communicators can communicate with perfect secrecy over wiretap networks. Our method of secure communication over wiretap networks without keys is fundamentally distinct from cryptographic means. Furthermore, a linear network code with perfect secrecy is available for a given wiretap multicast network provided that the cardinality of the alphabet is larger than a constant. Comparing with other approaches, no network capacity is lost by our method.