A New Provably Secure Certificateless Signature Scheme
Lei Zhang, Futai Zhang
2008.5.192008 IEEE International Conference on Communications
Paper details
- Journal
- 2008 IEEE International Conference on Communications
- Published
- 2008.5.19
- Citations
- 57
- References
- 17
- Access
- Open Access
- Fields
- Computer Science
tlooto Summary
The scheme can be proved secure in the strongest security model of certificateless signature schemes, in terms of computational cost, totally, only two pairing operations are required for signing and verification.
Abstract
Certificateless public key cryptography was introduced by Al-Riyami and Paterson to overcome the key escrow problem of ID-PKC. In this paper, we present an efficient certificateless signature scheme using bilinear maps. The scheme can be proved secure in the strongest security model of certificateless signature schemes. In terms of computational cost, totally, only two pairing operations are required for signing and verification. It is more efficient than the other existing certificateless signature schemes secure against a super type I/II adversary.
Citation format
ZHANG, Lei; ZHANG, Futai. A new provably secure certificateless signature scheme. 2008 IEEE International Conference on Communications, 2008: 1685–1689.