Public-Key Cryptography – PKC 2013

Volume 7778 of the series Lecture Notes in Computer Science pp 32-50

Chosen Ciphertext Secure Keyed-Homomorphic Public-Key Encryption

  • Keita EmuraAffiliated withNational Institute of Information and Communications Technology (NICT)
  • , Goichiro HanaokaAffiliated withJapan Broadcasting Corporation
  • , Go OhtakeAffiliated withNational Institute of Advanced Industrial Science and Technology (AIST)
  • , Takahiro MatsudaAffiliated withJapan Broadcasting Corporation
  • , Shota YamadaAffiliated withThe University of Tokyo

* Final gross prices may vary according to local VAT.

Get Access


In homomorphic encryption schemes, anyone can perform homomorphic operations, and therefore, it is difficult to manage when, where and by whom they are performed. In addition, the property that anyone can ‘‘freely” perform the operation inevitably means that ciphertexts are malleable, and it is well-known that adaptive chosen ciphertext (CCA) security and the homomorphic property can never be achieved simultaneously. In this paper, we show that CCA security and the homomorphic property can be simultaneously handled in situations that the user(s) who can perform homomorphic operations on encrypted data should be controlled/limited, and propose a new concept of homomorphic public-key encryption, which we call keyed-homomorphic public-key encryption (KH-PKE). By introducing a secret key for homomorphic operations, we can control who is allowed to perform the homomorphic operation. To construct KH-PKE schemes, we introduce a new concept, a homomorphic transitional universal hash family, and present a number of KH-PKE schemes through hash proof systems. We also present a practical construction of KH-PKE from the DDH assumption. For ℓ-bit security, our DDH-based scheme yields only ℓ-bit longer ciphertext size than that of the Cramer-Shoup PKE scheme.


homomorphic public key encryption CCA2 security hash proof system