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

Goichiro Hanaoka; Kaoru Kurosawa

Paper 2010/035

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

Goichiro Hanaoka and Kaoru Kurosawa

Abstract

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.

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: Published elsewhere. Unknown where it was published
Contact author(s): hanaoka-goichiro @ aist go jp
History: 2010-01-26: received
Short URL: https://ia.cr/2010/035
License: CC BY

BibTeX

@misc{cryptoeprint:2010/035,
      author = {Goichiro Hanaoka and Kaoru Kurosawa},
      title = {Between Hashed {DH} and Computational {DH}: Compact Encryption from Weaker Assumption},
      howpublished = {Cryptology {ePrint} Archive, Paper 2010/035},
      year = {2010},
      url = {https://eprint.iacr.org/2010/035}
}