Key points are not available for this paper at this time.
As the Internet of Things (IoT) is booming, the transmission speed of data in the network is getting more and more attention. Network coding is an effective technique to improve network throughput. In network coding, the encoded packets must be integrity-checked to prevent pollution attacks. Some linearly homomorphic signature (LHS) schemes based on bilinear pairs have been used to check the integrity of packets, and so far the scheme LZL20 is the most efficient signature scheme among them. Here, we first analyze the security model and signature structure of LZL20, and find that there is a security vulnerability in the scheme. Experiments show that for a 12–18 kB file, our signature forgery algorithm can forge a message/signature pair with 100% probability within 3–5 ms. Then, we construct a LHS scheme with higher signature efficiency and shorter signature length. In random oracle model, we proved the scheme is existentially unforgeable under adaptive chosen message attacks. We theoretically analyze our signature length to be 320 bits shorter than LZL20. Finally, we implement our scheme, and for a 12–18 kB file, experiments show that the signature time of our scheme is 60.93%–62.59% of that of LZL20.
Zhou et al. (Wed,) studied this question.