Public key encryption schemes with bounded CCA security and optimal ciphertext length based on the CDH assumption
- Mayana Pereira ,
- Rafael Dowsley ,
- Goichiro Hanaoka ,
- Anderson C. A. Nascimento
2010 International Conference on Information Security |
Published by Springer, Berlin, Heidelberg
In a public key encryption scheme was proposed against adversaries with a bounded number of decryption queries based on the decisional Diffie-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.