An Information-Theoretic Cryptanalysis of Network Coding - is Protecting the Code Enough?
- L. L. Lima; J.P. Vilela; Barros, J.; M. M. Médard;
"An Information-Theoretic Cryptanalysis of Network Coding - is Protecting the Code Enough?
International Symp. on Information Theory and its Applications - ISITA
We consider the issue of confidentiality in multicast network coding, by assuming that the encoding matrices, based upon variants of random linear network coding, are given only to the source and sinks. Based on this assumption, we provide a characterization of the mutual information between the encoded data and the two elements that can lead to information disclosure: the matrices of random coefficients and, naturally, the original data itself. Our results, some of which hold even with finite block lengths, show that, predicated on optimal source-coding, information-theoretic security is achievable for any field size without loss in terms of decoding probability. It follows that protecting the encoding matrix is generally sufficient to ensure confidentiality of network coded data.
Full text (PDF 476KB)