Abstract
It has been proven that network coding can provide significant benefits to networks, but such systems are very vulnerable to pollution attacks. In recent years, many schemes have been designed to prevent these attacks. But most of them are based on expensive operation, such as discrete logarithms and Weil pairing operations on elliptic curves, these schemes are inefficient in verifying the integrity of messages and not suitable for those scenarios with low computing capability such as mobile Ad hoc networks and wireless sensor networks. In this paper, we proposed a novel signature scheme for network coding based on a homomorphic public cryptography. This scheme can detect those polluted messages and discard them. What's more, replaying attacks are also infeasible in this scheme. The most important feature of this scheme is the improvement of the authentication efficiency with a fast computation, that is, the time complexity of the verification in our signature scheme is much less than those in the existing algorithms.