Secure obfuscation of EIGamal cryption system based on polynomials over finite fields

Abstract

As the traditional EIGamal encryption system can only encrypt a plaintext every time, while present secure obfuscation of EIGamal encryption system based on polynomials over finite fields can encrypt more than one plaintext at the same time. This encryption system not only retains the EIGamal public key system functions, but also has the advantages of indistinguishability obfuscation (i.e. difficult identification). The security of this scheme mainly depends on the characteristics of the hash function and the intractability of discrete logarithm problem.