Provably secure certificate-based proxy blind signature scheme from pairings

Abstract In 2003, C. Gentry introduced the paradigm of certificate-based encryption (CBE) to combine the merits of public key cryptography (PKC) and identity-based PKC (ID-PKC). The invention of CBE also remove the key escrow as well as secret key distribution problem in ID-PKC and the third party queries problem of PKC. This article presents the first short and efficient provably secure certificate-based proxy blind signature (CB-PBS) scheme from pairing over elliptic curves. The proposed CB-PBS scheme is proven secure under adaptively chosen message and ID attack in the random oracle model. Through efficiency comparison with existing related efficient PBS schemes, it is shown that the proposed CB-PBS scheme is the most efficient and short signature scheme. Due to the shortest length, it is the most appealing to implement in low bandwidth communication systems to design e-cash, e-voting, etc.