An Efficient Fair Blind Signature Scheme with Message Recovery Using Pairing-based Cryptosystems with Provable Security

Abstract

The blind signature could be used in electronic payment systems to achieve the properties of unlinkability and anonymity. Unfortunately, this characteristic may be used to pervert the ability of the scheme. Accordingly, Lee and Kim proposed a fair blind signature scheme with message recovery in 1999. However, the fairness of blind signature can not be actually achieved in Lee and Kim’s scheme. In this paper, the proposed cryptosystems are first constructed by using the pairing-based cryptosystems instead of modular exponentiation, and further integrating the identity-based self-certified public key cryptosystems. Furthermore, we employ the integrated cryptosystems to design a fair blind signature scheme with message recovery to improve the drawback on Lee and Kim's scheme, and give security proofs on the proposed blind signature scheme.