On Homomorphic Encryption and Chosen-Ciphertext Security

Brett Hemenway; Rafail Ostrovsky

Paper 2010/099

On Homomorphic Encryption and Chosen-Ciphertext Security

Brett Hemenway and Rafail Ostrovsky

Abstract

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.

Metadata

Available format(s): PDF
Publication info: Published elsewhere. In Proceedings of PKC 2012
Keywords: public-key cryptography homomorphic encryption chosen ciphertext security
Contact author(s): bhemen @ umich edu
History: 2012-03-22: last of 2 revisions; 2010-03-01: received; See all versions
Short URL: https://ia.cr/2010/099
License: CC BY

BibTeX

@misc{cryptoeprint:2010/099,
      author = {Brett Hemenway and Rafail Ostrovsky},
      title = {On Homomorphic Encryption and Chosen-Ciphertext Security},
      howpublished = {Cryptology {ePrint} Archive, Paper 2010/099},
      year = {2010},
      url = {https://eprint.iacr.org/2010/099}
}