Paper 2010/099

On Homomorphic Encryption and Chosen-Ciphertext Security

Brett Hemenway and Rafail Ostrovsky


Chosen-Ciphertext (IND-CCA) security is generally considered the right notion of security for a cryptosystem. Because of its central importance much effort has been devoted to constructing IND-CCA secure cryptosystems. In this work, we consider constructing IND-CCA secure cryptosystems from (group) homomorphic encryption. Our main results give natural and efficient constructions of IND-CCA secure cryptosystems from any homomorphic encryption scheme that satisfies weak cyclic properties, either in the plaintext, ciphertext or randomness space. Our results have the added benefit of being simple to describe and analyze.

Note: Updated the references. Clarified some of the exposition.

Available format(s)
Publication info
Published elsewhere. In Proceedings of PKC 2012
public-key cryptographyhomomorphic encryptionchosen ciphertext security
Contact author(s)
bhemen @ umich edu
2012-03-22: last of 2 revisions
2010-03-01: received
See all versions
Short URL
Creative Commons Attribution


      author = {Brett Hemenway and Rafail Ostrovsky},
      title = {On Homomorphic Encryption and Chosen-Ciphertext Security},
      howpublished = {Cryptology ePrint Archive, Paper 2010/099},
      year = {2010},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.