Certificateless Blind Signcryption With Low Complexity

Elliptic curve cryptosystem (ECC) has the merits of providing shorter key length and higher processing speed compared with other public key cryptosystems with respect to the same security level. In addition, blind signcryption is widely used for privacy-preserving applications, such as electronic cash, electronic voting, electronic auction and electric contract. In this work, we construct certificateless blind signcryption with low complexity (LC-CLBS) by combining elliptic curve blind signcryption with certificateless public key cryptosystem. Its security is based on the intractability of the discrete logarithm and computational Diffie-Hellman problems in elliptic curve. Analysis demonstrates that LC-CLBS scheme enjoys high computational efficiency and low communication overheads. LC-CLBS scheme is especially suitable to be implemented in resource-restrained devices, e.g. it is appropriate for various applications in the ubiquitous mobile computing environments.

Abstract licence: CC BY-NC-ND

21 more references, whose wording the paper’s licence keeps private.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.