A novel identity-based signature with message recovery from RSA

Several identity-based signature schemes with message recovery have already been proposed so far, and most of the existing schemes are constructed from the bilinear pairings. Although the bilinear pairings are quite useful in the study of cryptography, it is hard to implement and computationally expensive. In this paper, we describe a novel identity-based signature scheme with message recovery from RSA, which does not need to employ the bilinear pairings. Under the hardness of RSA problem, our scheme satisfies existential unforgeable against adaptive chosen identity and message attacks in the random oracle model. Furthermore, we extend our scheme for partial message recovery, such that it can deal with the messages of arbitrary length.

[1]  Kefei Chen.  Signature with message recovery , 1998 .

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

[3]  Jean-Jacques Quisquater,et al.  A "Paradoxical" Indentity-Based Signature Scheme Resulting from Zero-Knowledge , 1988, CRYPTO.

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

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

[6]  Mihir Bellare,et al.  Identity-Based Multi-signatures from RSA , 2007, CT-RSA.

[7]  Zhu Wang,et al.  A Practical Identity-Based Signature Scheme from Bilinear Map , 2007, EUC Workshops.

[8]  Javier Herranz.  Identity-based ring signatures from RSA , 2007, Theor. Comput. Sci..

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

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

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

[12]  Raylin Tso,et al.  Efficient ID-Based Digital Signatures with Message Recovery , 2007, CANS.

[13]  Kenneth G. Paterson,et al.  Certificateless Public Key Cryptography , 2003 .

[14]  Paulo S. L. M. Barreto,et al.  Efficient and Provably-Secure Identity-Based Signatures and Signcryption from Bilinear Maps , 2005, ASIACRYPT.

[15]  Chanathip Namprempre,et al.  Security Proofs for Identity-Based Identification and Signature Schemes , 2004, EUROCRYPT.

[16]  Rainer A. Rueppel,et al.  Message Recovery for Signature Schemes Based on the Discrete Logarithm Problem , 1994, EUROCRYPT.

[17]  Jung Hee Cheon,et al.  An Identity-Based Signature from Gap Diffie-Hellman Groups , 2003, Public Key Cryptography.