A New Blind Identity-Based Signature Scheme with Message Recovery

In this paper, a new blind identity-based signature scheme with message recovery based on bilinear pairings on elliptic curves is presented. The work is motivated by the importance of blind signatures as a cryptographic primitive essential in protocols that guarantee anonymity of users. This is particularly of interest in DRM systems, electronic cash systems, electronic voting systems and location-based mobile services that are becoming common those days. Anonymous identifiers may be used to protect the privacy of users. Blind signatures present a practical tool for issuing such identifiers. The proposed scheme is a blind signature scheme with message recovery and consequently achieves bandwidth savings. Since the proposed scheme is identity-based, the user’s public key is easily extracted from his identification information. This eliminates the certificates for public keys needed in traditional public key cryptosystems. Moreover, the use of bilinear pairings over elliptic curves enables utilizing smaller key sizes, while achieving the same level of security compared to other schemes not utilizing elliptic curves. The correctness of the proposed scheme has been validated. Security proofs for the blindness property and unforgeability have been developed.

[1]  Antoine Joux,et al.  A One Round Protocol for Tripartite Diffie–Hellman , 2000, Journal of Cryptology.

[2]  Jean-Jacques Quisquater,et al.  Identity Based Undeniable Signatures , 2004, CT-RSA.

[3]  Jean-Jacques Quisquater,et al.  A new identity based signcryption scheme from pairings , 2003, Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674).

[4]  Adi Shamir,et al.  Identity-Based Cryptosystems and Signature Schemes , 1984, CRYPTO.

[5]  Atsushi Fujioka,et al.  A Practical Secret Voting Scheme for Large Scale Elections , 1992, AUSCRYPT.

[6]  Matthew K. Franklin,et al.  Identity-Based Encryption from the Weil Pairing , 2001, CRYPTO.

[7]  Yi Mu,et al.  Identity-Based Partial Message Recovery Signatures (or How to Shorten ID-Based Signatures) , 2005, Financial Cryptography.

[8]  David Chaum,et al.  Blind Signatures for Untraceable Payments , 1982, CRYPTO.

[9]  Peter Wayner,et al.  Digital cash - commerce on the net , 1995 .

[10]  Marcus Stögbauer.  Efficient Algorithms for Pairing-Based Cryptosystems , 2004 .

[11]  Zulfikar Amin Ramzan,et al.  Group blind digital signatures : theory and applications , 1999 .

[12]  Jacques Stern,et al.  New Blind Signatures Equivalent to Factorization , 1997, CCS 1997.

[13]  Claus-Peter Schnorr,et al.  Efficient Identification and Signatures for Smart Cards (Abstract) , 1990, EUROCRYPT.

[14]  Eric R. Verheul,et al.  Self-Blindable Credential Certificates from the Weil Pairing , 2001, ASIACRYPT.

[15]  Tatsuaki Okamoto,et al.  A Signature Scheme with Message Recovery as Secure as Discrete Logarithm , 1999, ASIACRYPT.

[16]  Jacques Stern,et al.  Provably Secure Blind Signature Schemes , 1996, ASIACRYPT.

[17]  Tatsuaki Okamoto,et al.  Provably Secure and Practical Identification Schemes and Corresponding Signature Schemes , 1992, CRYPTO.

[18]  Mihir Bellare,et al.  Random oracles are practical: a paradigm for designing efficient protocols , 1993, CCS '93.

[19]  C. P. Schnorr,et al.  Efficient Identification and Signatures for Smart Cards (Abstract) , 1989, EUROCRYPT.

[20]  Florian Hess,et al.  Efficient Identity Based Signature Schemes Based on Pairings , 2002, Selected Areas in Cryptography.