Article Title
Targeted Fully Homomorphic Encryption Based on a Double Decryption Algorithm for Polynomials
Keywords
targeted fully homomorphic encryption, discrete logarithm problem, exponential function method, power function method
Abstract
Several public-key encryption schemes used to solve the problem of ciphertext data processing on the fly are discussed. A new targeted fully homomorphic encryption scheme based on the discrete logarithm problem is presented. Public-key encryption cryptosystems are classified to examine homomorphic encryption. Without employing techniques proposed by Gentry such as somewhat homomorphic and bootstrapping techniques, or relinearization technique proposed by Brakerski et al., a new method called " Double Decryption Algorithm" is employed in our cryptography to satisfy a fully or targeted fully homomorphic property. Inspired by ElGamal and BGN cryptography, we obtain the desired fully homomorphic property by selecting a new group and adding an extra component to the ciphertext. Proof of semantic security is also demonstrated.
Publisher
Tsinghua University Press
Recommended Citation
Yatao Yang, Shuang Zhang, Junming Yang et al. Targeted Fully Homomorphic Encryption Based on a Double Decryption Algorithm for Polynomials. Tsinghua Science and Technology 2014, 19(05): 478-485.