Public-key encryption schemes with bounded CCA security and optimal ciphertext length based on the CDH and HDH assumptions

Mayana Pereira, Rafael Dowsley, Anderson C.A. Nascimento, Goichiro Hanaoka

Research output: Contribution to journalArticleResearchpeer-review


In Cramer et al. (2007, Bounded CCA2-Secure Encryption. In Kurosawa, K. (ed.), Advances in Cryptology - ASIACRYPT 2007, Kuching, Malaysia, December 2-6, Lecture Notes in Computer Science, Vol. 4833, pp. 502-518. Springer, Berlin, Germany) proposed a public-key encryption scheme secure against adversaries with a bounded number of decryption queries based on the decisional Diffie-Hellman problem. In this paper, we show that the same result can be obtained based on weaker computational assumptions, namely: the computational Diffie-Hellman and the hashed Diffie-Hellman assumptions.

Original languageEnglish
Pages (from-to)2738-2746
Number of pages9
JournalThe Computer Journal
Issue number10
Publication statusPublished - Oct 2015
Externally publishedYes


  • bounded chosen ciphertext security
  • computational Diffie-Hellman
  • public-key encryption

Cite this