Practical Provably Secure Encryption Scheme Based on Hashed Bilinear Pairing

In this paper, we propose a new encryption scheme that is said to be IND-CPA secure and makes use of a keyed hash bilinear pairing to XOR the message under the standard model, where the key is encrypted by the RSA algorithm, which greatly improves the safety and practicality of the scheme. To give the proof, the paper designs a series of indistinguishable thinking games through the adversary’s challenge to the system established by the challenger, which reduces the security of the scheme to the hardness of the Decisional Bilinear Diffie-Hellman (DBDH) assumption and the Entropy Smoothing (ES) assumption.