A Blind Signature Scheme from Bilinear Pairings

Bilinear pairings is an important tool to make cryptosystem,but computation of bilinear pairings is more than other operations,in other words,it is time-consuming,that will affect efficiency of the implementation of the program.A blind signature scheme from bilinear parings is proposed in this paper,the computation of bilinear pairings is less than presented blind schemes,and which has several security characteristics,such as blindness,non-forgery etc.