Skip to Main Content
Recently, Al-Riyami and Paterson introduced a new and attractive paradigm named certiflcateless public key cryptography (CL-PKC), which avoids the key-escrow problem in identity-based cryptography (ID-PKC) and eliminates the expensive certificates used in the public key infrastructure (PKI). In this paper, based on Choi et al.'s efficient provably-secure certificateless signature (CLS) schemes, two new efficient certificateless blind signature schemes are proposed in this new setting. Compared with the existed constructions, the proposed schemes require less computational cost and satisfy all the requirements of blind signatures, especially the properties of strong unforgeability and unlinkability (blindness).