An ID-based Quadratic-Exponentiation Randomized Cryptographic scheme

In this paper, we presented an ID-based Quadratic-Exponentiation Randomized (QER) Cryptosystem under the security assumptions of the discrete logarithm problem (DLP) and integer factorization problem (IFP). We consider the security against a conspiracy of some entities in the proposed system and show the possibility of establishing a more secure system. The obtained results show the special outcomes from the point view of security as we face the issue of solving IFP and DLP simultaneously in the multiplicative group of finite fields as compared to the other ID-based cryptographic scheme. Our proposed scheme requires a nominal operation in encryption and decryption algorithms, which makes it very effective and powerful.