A CVP-based lattice signature scheme for network coding

Pollution attack is one of the main threats confronting network coding. The policy of detection and prevention of polluted messages is an important aspect of secure framework in a network based on network coding. Inspired by the idea of self/nonself discrimination in immune principle, signature is an effective approach to the discrimination of normal message and abnormal message. Most of the existent signature schemes cannot catch up with the rapid development of high-speed computers. To provide a high-security guarantee to network coding and lower the computing complexity induced by signature scheme, we introduce lattice theory to construct a secure signature scheme. Firstly, we propose a lattice-based signature scheme for network coding and its core algorithm Sample CVP which can ensure the randomness of output signature. Secondly, we stipulate its security to the hard problem CVP (Closest Vector Problem) on lattices. Security analyses show that the proposed scheme has a stronger unforgeability for the natural property of lattices than traditional signature schemes.