New Efficient Certificateless Signature Scheme

In ubiquitous computing environment, how to implement security and trust among the users that connected to a network is a big problem. Digital signature provides authenticity, integrity and nonrepudiation to many kinds of applications in ubiquitous computing environment. In this paper, we present a very efficient certificateless signature scheme from bilinear maps. In our scheme, only one paring operation is needed in the signing and verification processes. The security of the new scheme is based on the intractability of the q-Strong Diffie-Hellman (q-SDH) Problem and the Discrete Logarithm Problem. We prove the existential unforgeability of our scheme under adaptively chosen message attack against both types of adversaries in the random oracle model [3].

[1]  Bok-Min Goi,et al.  An Efficient Certificateless Signature Scheme , 2006, IACR Cryptol. ePrint Arch..

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

[3]  Duncan S. Wong,et al.  Certificateless Public-Key Signature: Security Model and Efficient Construction , 2006, ACNS.

[4]  Dengguo Feng,et al.  Key Replacement Attack on a Certificateless Signature Scheme , 2006, IACR Cryptol. ePrint Arch..

[5]  Ashutosh Saxena,et al.  An Efficient Certificateless Signature Scheme , 2005, CIS.

[6]  Pil Joong Lee,et al.  Generic Construction of Certificateless Signature , 2004, ACISP.

[7]  Xiangxue Li,et al.  Certificateless signature and proxy signature schemes from bilinear pairings , 2005 .

[8]  Yi Mu,et al.  Identity-Based Strong Designated Verifier Signature Schemes , 2004, ACISP.

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

[10]  Dan Boneh,et al.  Short Signatures Without Random Oracles , 2004, EUROCRYPT.

[11]  Yi Mu,et al.  On the Security of Certificateless Signature Schemes from Asiacrypt 2003 , 2005, CANS.

[12]  Reihaneh Safavi-Naini,et al.  An Efficient Signature Scheme from Bilinear Pairings and Its Applications , 2004, Public Key Cryptography.

[13]  Jean-Jacques Quisquater,et al.  On Constructing Certificateless Cryptosystems from Identity Based Encryption , 2006, Public Key Cryptography.

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

[15]  Xiaotie Deng,et al.  Key Replacement Attack Against a Generic Construction of Certificateless Signature , 2006, ACISP.

[16]  Jacques Stern,et al.  Security Proofs for Signature Schemes , 1996, EUROCRYPT.

[17]  Kenneth G. Paterson,et al.  An Attack on a Certificateless Signature Scheme , 2006, IACR Cryptol. ePrint Arch..

[18]  Je Hong Park,et al.  An attack on the certificateless signature scheme from EUC Workshops 2006 , 2006, IACR Cryptol. ePrint Arch..

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

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