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. © 2012 International Association for Cryptologic Research.
Cite
CITATION STYLE
Hemenway, B., & Ostrovsky, R. (2012). On homomorphic encryption and chosen-ciphertext security. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7293 LNCS, pp. 52–65). https://doi.org/10.1007/978-3-642-30057-8_4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
