Blind signature allows the user to obtain a signature of a message in a way that the signer learns neither the message nor the resulting signature. Recently a lot of signature or encryption schemes are provably secure with random oracle, which could not lead to a cryptographic scheme secure in the standard model. Therefore designing efficient schemes provably secure in the standard model is a central line of modern cryptography. Followed this line, we proposed an efficiently blind signature without using hash function. Based on the complexity of
-SDH problem, we present strict proof of security against one more forgery under adaptive chosen message attack in the standard model. A full blind testimony demonstrates that our scheme bear blind property. Compared with other blind signature schemes, we think proposed scheme is more efficient. To the best of our knowledge, our scheme is the first blind signature scheme from pairings proved secure in the standard model.