Performance of secure network coding based on homomorphic encryption

Recently, a number of cryptographic security measures for random network coding (RNC) has been proposed in literature in response to the security treats to RNC; however most of them are computationally heavy. In this paper, we evaluate the performance of a secure network coding scheme based on a homomorphic encryption scheme and discuss how to minimize its computational cost. Via experimental results, we argue that our method reduces computational overhead significantly in some settings.