Public Key Encryption Schemes with Bounded CCA Security and Optimal Ciphertext Length Based on the CDH Assumption

摘要

In [2] a public key encryption scheme was proposed against adversaries with a bounded number of decryption queries based on the decisional DifRe-Helman Problems. In this paper, we show that the same result can be easily obtained based on weaker computational assumption, namely: the computational Diffie-Helman assumption.