Efficient Anonymous Certificateless Multi-Receiver Signcryption Scheme Without Bilinear Pairings

Abstract

Certificateless multi-receiver encryption/signcryption (CLME/CLMS) has become a research hotspot in the field of information security. Almost all of the existing CLME/CLMS schemes are constructed based on the bilinear pairing computation, a time-consuming operation, which makes their computational efficiency relatively low. Although there are some CLME schemes constructed on scalar point multiplications on elliptic curve cryptography (ECC) instead of the bilinear pairing computation, too many scalar point multiplications involved still lead to the low computational efficiency. Therefore, there is still room for the CLME/CLMS schemes in efficiency. Motivated by these concerns, an efficient anonymous certificateless multi-receiver signcryption scheme is proposed with its security proved under the random oracle model. The proposed scheme is improved largely in computational efficiency by the idea that it is designed based on scalar point multiplications on ECC instead of the bilinear pairing and the number of scalar point multiplications on ECC is reduced as small as possible.