Cryptology ePrint Archive: Report 2008/211
Efficient Chosen Ciphertext Secure Public Key Encryption under the Computational Diffie-Hellman Assumption
Goichiro Hanaoka and Kaoru Kurosawa
Abstract: Recently Cash, Kiltz, and Shoup showed a variant of the Cramer-Shoup (CS) public key encryption (PKE) scheme whose chosen-ciphertext (CCA) security relies on the computational Diffie-Hellman (CDH) assumption. The cost for this high security is that the size of ciphertexts is much longer than the CS scheme. In this paper, we show how to achieve CCAsecurity under the CDH assumption without increasing the size of ciphertexts. We further show a more efficient scheme under the hashed Diffie-Hellman (HDH) assumption such that the size of ciphertexts is the same as that of the Kurosawa-Desmedt (KD) scheme. Note that the CDH and HDH assumptions are weaker than the decisional Diffie-Hellman assumption which the CS and KD schemes rely on. Both of our schemes are based on a certain broadcast encryption (BE) scheme while the Cash-Kiltz-Shoup scheme is based on a different paradigm which is called the Twin DH problem.
As an independent interest, we also show a generic method of constructing CCA-secure PKE schemes from BE schemes such that the existing CCA-secure constructions can be viewed as special cases.
Category / Keywords: public-key cryptography / public key encryption, CCA security, the CDH assumption
Date: received 13 May 2008, last revised 2 Jun 2008
Contact author: hanaoka-goichiro at aist go jp
Available format(s): PDF | BibTeX Citation
Version: 20080602:080744 (All versions of this report)
Short URL: ia.cr/2008/211
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]