As we all know, the random oracle model (ROM) is a simulation of the hash function and cannot replace the actual computation of hash function and the public-key cryptography scheme,… Click to show full abstract
As we all know, the random oracle model (ROM) is a simulation of the hash function and cannot replace the actual computation of hash function and the public-key cryptography scheme, which was proved to be secure in ROM may be insecure when instantiating random oracles with concrete hash functions in practical applications. So far as we know, certificateless proxy signcryption (CLPSC) scheme’s security is only proved by applying ROM. Therefore, it is quite important to construct a CLPSC scheme in the standard model (SM). In this article, we propose the first CLPSC scheme in SM, which can achieve public verifiability and we prove that this scheme is EUF-CMA-CLPSC security and IND-CCA-CLPSC security against type I adversary
               
Click one of the above tabs to view related content.