Article
Public-Key Encryption Schemes With Bounded CCA Security and Optimal Ciphertext Length Based on the CDH and HDH Assumptions
The Computer Journal
Publication Date
6-8-2015
Document Type
Article
Abstract
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.
DOI
10.1093/comjnl/bxv040
Publisher Policy
pre-print, post-print (with 12 month embargo)
Citation Information
Mayana Pereira, Rafael Dowsley, Anderson C. Nascimento and Goichiro Hanaoka. "Public-Key Encryption Schemes With Bounded CCA Security and Optimal Ciphertext Length Based on the CDH and HDH Assumptions" The Computer Journal Vol. 58 Iss. 10 (2015) p. 2738 - 2746 Available at: http://works.bepress.com/anderson-nascimento/11/