International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Homomorphic Encryption Over Cyclic Groups Implies Chosen-Ciphertext Security

Authors:
Brett Hemenway
Rafail Ostrovsky
Download:
URL: http://eprint.iacr.org/2010/099
Search ePrint
Search Google
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 the problem of constructing IND-CCA secure cryptosystems from (group) homomorphic encryption. Our main results are 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 simple and elegant proofs.
BibTeX
@misc{eprint-2010-23000,
  title={Homomorphic Encryption Over Cyclic Groups Implies Chosen-Ciphertext Security},
  booktitle={IACR Eprint archive},
  keywords={public-key cryptography / chosen ciphertext secrity, homomorphic encryption, lossy trapdoor functions, hash proof systems},
  url={http://eprint.iacr.org/2010/099},
  note={ bretth@math.ucla.edu 14830 received 23 Feb 2010, last revised 9 Aug 2010},
  author={Brett Hemenway and Rafail Ostrovsky},
  year=2010
}