In Evaluating 2-DNF Formulas on Ciphertexts stated that
decryption in this system takes polynomial time in the size of the message space T. Therefore, the system as described above can only be used to encrypt short messages
Is there any other extension with the same properties of (any number of addition and one multiplication operation on the ciphertext) but also allows bigger message space?
In my search, I encounter only in Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups, but it does not solve that limitation.