TY - GEN
T1 - A new provably secure certificateless signature scheme
AU - Zhang, Lei
AU - Zhang, Futai
PY - 2008
Y1 - 2008
N2 - 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.
AB - 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.
KW - Certificateless cryptography
KW - Certificateless signature
KW - Computational Diffie-Hellman problem
KW - Random oracle model
UR - https://www.scopus.com/pages/publications/51249113617
U2 - 10.1109/ICC.2008.325
DO - 10.1109/ICC.2008.325
M3 - 会议稿件
AN - SCOPUS:51249113617
SN - 9781424420742
T3 - IEEE International Conference on Communications
SP - 1685
EP - 1689
BT - ICC 2008 - IEEE International Conference on Communications, Proceedings
T2 - IEEE International Conference on Communications, ICC 2008
Y2 - 19 May 2008 through 23 May 2008
ER -