Lattice-based blind signature schemes

Using preimage sampleable functions, we propose a new lattice-based two moves blind signature scheme. The proposed scheme is not only unconditionally blind but also one-more unforgeable due to the hardness of the shortest integral solution on lattice, which is proved in the random oracle model. Compared with a well known lattice-based three moves blind signature scheme introduced by Markus Rückert, it shows that the proposed scheme can avoid the failure to sign, Moreover, the proposed scheme has less moves(two moves) and shorter length of signature. Hence it can be concluded that the proposed scheme is more efficient than the known lattice-based blind signature scheme.