Improved Fully Homomorphic Encryption over the Integers with Shorter Public Keys

Can Xiang, Chun-ming Tang
2014 International Journal of Security and Its Applications  
Fully homomorphic encryption (FHE) is a "holy grail" of cryptography. However, it is not yet adopted in practice because no known scheme is efficient. In this paper, we mainly focus on how to reduce the public key sizes in FHE. Based on Dijk et al.'s FHE scheme (DGHV) and Gentry's fully homomorhpic technology, we propose two schemes with shorter public keys by encrypting with a combination of the public key elements to replace a linear form in DGHV scheme and a quadratic form in Coron et al.'s
more » ... cheme. Compared with DGHV scheme and Coron et al.'s scheme, our schemes can greatly reduce the public key sizes, which make our schemes more efficient. Furthermore, we prove the security of our schemes based on difficulties of the approximate greatest common divisor (AGCD) problem and the sparse subset sum problem. 366 Copyright ⓒ 2014 SERSC perform arithmetic operations on it without learning anything about the original raw data, by performing operations on the encrypted data. FHE can be used to query a search engine, without revealing what is being searched for (here, the search engine is doing the computations on encryptions of information that it doesn't know).
doi:10.14257/ijsia.2014.8.6.31 fatcat:bdtckdmtebahnc4ihj5t4l32vm