Paper 2014/989

Controlled Homomorphic Encryption: Definition and Construction

Yvo Desmedt, Vincenzo Iovino, Giuseppe Persiano, and Ivan Visconti


In this work we put forth the notion of a Controllable Homomorphic Encryption scheme (CHES), a new primitive that includes features of both FHEs and FunctEs. In a CHES it is possible (similarly to a FHE) to homomorphically evaluate a ciphertext Ct = Enc(m) and a circuit C therefore obtaining Enc(C(m)) but only if (similarly to a FunctE) a token for C has been received from the owner of the secret key. We discuss difficulties in constructing a CHES and then show a construction based on any FunctE. As a byproduct our CHES also represents a FunctE supporting the re-encryption functionality and in that respect improves existing solutions.

Note: In this eprint version we clarify the relation with previous works on functional encryption for randomized functionalities and related primitives

Available format(s)
Publication info
Published elsewhere. MINOR revision.WAHC '17 (FC Workshop)
Functional EncryptionNon-malleabilityFully Homomorphic Encryption
Contact author(s)
vinciovino @ gmail com
2017-02-16: last of 5 revisions
2014-12-18: received
See all versions
Short URL
Creative Commons Attribution


      author = {Yvo Desmedt and Vincenzo Iovino and Giuseppe Persiano and Ivan Visconti},
      title = {Controlled Homomorphic Encryption: Definition and Construction},
      howpublished = {Cryptology ePrint Archive, Paper 2014/989},
      year = {2014},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.