Sciweavers

Share
IEICET
2010

Between Hashed DH and Computational DH: Compact Encryption from Weaker Assumption

8 years 10 months ago
Between Hashed DH and Computational DH: Compact Encryption from Weaker Assumption
In this paper, we introduce the intermediate hashed Diffie-Hellman (IHDH) assumption which is weaker than the hashed DH (HDH) assumption (and thus the decisional DH assumption), and is stronger than the computational DH assumption. We then present two public key encryption schemes with short ciphertexts which are both chosen-ciphertext secure under this assumption. The short-message scheme has smaller size of ciphertexts than Kurosawa-Desmedt (KD) scheme, and the long-message scheme is a KD-size scheme (with arbitrary plaintext length) which is based on a weaker assumption than the HDH assumption. Key words: public key encryption, chosen-ciphertext security, Diffie-Hellman assumption
Goichiro Hanaoka, Kaoru Kurosawa
Added 26 Jan 2011
Updated 26 Jan 2011
Type Journal
Year 2010
Where IEICET
Authors Goichiro Hanaoka, Kaoru Kurosawa
Comments (0)
books