Chosen-ciphertext secure fully homomorphic encryption

Ran Canetti, Srinivasan Raghuraman, Silas Richelson, Vinod Vaikuntanathan

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


We give three fully homomoprhic encryption (FHE) schemes that are secure against non-adaptive chosen ciphertext attacks (CCA1). For the first two, we extend the generic transformation of Boneh, Canetti, Halevi and Katz to turn any multi-key identity-based FHE scheme into a CCA1-secure FHE scheme. We then show two instantiations of multikey identity-based FHE: One from LWE in the random oracle model, and one from sub-exponentially secure indistinguishability obfuscation. Both constructions are compact with respect to the function evaluated homomorphically but not compact with respect to the number of ciphertext involved in the homomorphic evaluation. The third scheme uses succinct non-interactive arguments of knowledge (SNARKs) and is fully compact.

Original languageEnglish
Title of host publicationPublic-Key Cryptography – PKC 2017 - 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Proceedings
EditorsSerge Fehr
PublisherSpringer Verlag
Number of pages28
ISBN (Print)9783662543870
StatePublished - 2017
Event20th IACR International Conference on Practice and Theory of Public-Key Cryptography, PKC 2017 - Amsterdam, Netherlands
Duration: 28 Mar 201731 Mar 2017

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10175 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference20th IACR International Conference on Practice and Theory of Public-Key Cryptography, PKC 2017
City Amsterdam


Dive into the research topics of 'Chosen-ciphertext secure fully homomorphic encryption'. Together they form a unique fingerprint.

Cite this