An Efficient Fully Homomorphic Encryption over Integers

The concept of EHE has been introduced for decades. There has been no scheme supporting FHE until Gentry proposed the first one in 2009[2]. After Gentry's breakthrough work, many researchers have developed many methods to improve Gentry's original scheme [1] [3] [4] [6]. However, so far there is no methods that are practical because the calculations take very long time.We have improved Gentry's scheme by speeding up the calculation and thereby making it much more practical. We developed two strategies to speed up the calculations. First, we used only one bootstrapping transformation in our scheme. Second, we used field addition and multiplication operations instead of ”circuit” (bit operation) except during the bootstrapping stage.In brief, one major concept difference makes our scheme is much more efficient than Gentry's. Gentry used complex circuits to evaluate the cipher text of function f. In contrary, we used a simple, straightforward and efficient method to evaluate it.

並列關鍵字

fully homomorphic encryption ； bootstrapping ； approximate GCD

國際替代計量

全文下載

主題瀏覽