Preserving the privacy of sensitive data such as mercantile, medical, political or financial might utilize encryption, these encrypted data, in some cases, may be needed to be decrypted by other party, for this issue, the dual receiver encryption, DRE, scheme is constructed. Since the development of the first DRE and until now, several DRE schemes have been constructed, some of these schemes are based on bilinear pairings and others are lattice based. The lattice based DRE schemes have larger key size and does not corroborate the public verifiability whereas pairing based schemes suffers from higher computational cost. In the present work, we propose a construction of DRE without pairing to avoid the computational complexity problems. The proposed scheme is based on the decisional Diffie-Hellman security assumption. Our proposed scheme is secure under chosen cipher text attack. In addition, the suggested scheme achieves public verifiability and reduces computational complexity. In terms of computational complexity, our scheme saves about 53% compared to others with pairing in literature.

KEYWORDS: Security, security systems, dual receiver encryption, discrete logarithm problem, Diffie Hellman assumption, bilinear pairing based cryptography, lattice- based cryptography, CCA security, Internet of Things (IoT).