An Efficient Pairing-Free Certificateless Signcryption Without Secure Channel Communication During Secret Key Issuance ☆

摘要

Signcryption is one of the recent public key paradigms that satisfies both the requirement of authenticity and confidentiality of messages between parties. However, most of all the existing schemes use secure channel communication while distributing the partial-private-keys to the users in the network. However, it is not always efficient to establish a secure channel during the interaction between entities. To address this issue, this paper aims to present a new certificateless signcryption scheme that does not consider secure channel communication. The proposed scheme is designed without considering high computation bilinear pairing and map-to-point (MTP) hash function. The scheme can be shown secured in the random oracle model based on the infeasibility elliptic curve discrete logarithm problem (ECDLP). Performance analysis demands better acceptability than other existing ones.