Secure Error-Correction Network Coding
一种安全的纠错网络编码

In this paper, a secure error-correcting network coding is proposed using a metric on the space of all subspaces of a message vector space. It shows that a minimum distance decoder for this metric can correct errors of a limited dimension. On the other hand, when the number of channels the adversary can eavesdrop on is less than the max-flow of a network, the adversary can not get any information about the source. Furthermore, when the source and the destination shares a Pseudo-Random number generator and a secret key, the coding scheme can prevent adversary who can eavesdrop on all the channels of a network.