Abstract: Network coding for content distribution has been in recent, researches lately owing to its wide applications in distribution of shared multimedia content, etc. In network coding, an intermediary node can combine different packets together in order to reduce the number of transmissions and thus increase the overall throughput of the network. Since, attackers tend to inject fake data in order to corrupt the process of content distribution, so that the distribution of information gets hindered and the network resources gets exhausted, content verification becomes a crucial issue when network coding is used. Moreover, it is quite infeasible to use the conventional hash-and-sign methodologies to sign all the data. Therefore, a homomorphic hash function is proposed to overcome the anomaly. However, this technique is quite complex in application and has communication overheads. So, researchers further explore the technique by examining and proposing other methods to aid in reducing computational cost, keeping the security concern in parallel.