An Efficient Certificate-Based Linearly Homomorphic Signature Scheme for Secure Network Coding

With the development of mobile crowdsensing systems (MCSs), wireless network transmission efficiency has attracted widespread attention. Network coding can be used in wireless communication to improve network throughput and robustness, which allows intermediate nodes to perform arbitrary coding operations on data packets. However, the data packet in network coding systems is vulnerable to pollution attacks. The special operation of intermediate nodes makes some security protocols in traditional store-and-forward networks unavailable in network coding systems. To address this problem, an efficient certificate-based linearly homomorphic signature scheme against pollution attacks in network coding systems is presented. A novel homomorphic contraction mapping technique is introduced to reduce the computational cost of signature generation. In the proposed scheme, the computational cost of both signature generation and verification is independent of the data packet size. Furthermore, a construction is provided to simultaneously defend against both eavesdropping attacks and pollution attacks in unicast networks. The security of the certificate-based linearly homomorphic signature scheme is formally proved in the random oracle model (ROM), and the scheme is implemented using the Java Pairing-Based Cryptography (JPBC) library. Simulation results demonstrate that the scheme is efficient and practical for real-world deployments in public environments without requiring secure channels.