Efficient Provably Secure ID-based Blind Signature with Message Recovery

Abstract

Due to the rapid growth in popularity of electronic cash, electronic voting and locationbased mobile, the design of secure schemes with low-bandwidth and blocking attacks capability is an important research issue. In this paper, we propose an efficient provably secure ID-based blind signature with message recovery scheme based on bilinear pairings. In the scheme, the original message is not required to be transmitted together with the signature and it can be recovered during the signature verification process. Assuming the intractability of the q-Strong Diffie-Hellman problem, our scheme is unforgeable under adaptive chosen-message and ID attack. The proof of correctness and blindness property analysis of the proposed scheme are presented. The scheme can offer advantages in runtime over the schemes available.