Provably secure certificateless encryption scheme in the standard model
Lunzhi Deng, Tian Xia, Xiuru He · KSII Transactions on Internet and Information Systems · 2020
Recently, numerous certificateless encryption (CLE) schemes have been introduced.The security proofs of most schemes are given under the random oracle model (ROM).In the standard model, the adversary is able to calculate the hash function instead of asking the challenger.Currently, there is only one scheme that was proved to be secure in SM.In this paper, we constructed a new CLE scheme and gave the security proofs in SM.In the new scheme, the size of the storage space required by the system is constant.The computation cost is lower than other CLE schemes due to it needs only two pairing operations.