Fully Homomorphic Encryption Based On the Parallel Computing

• Delin Tan,
• Huajun Wang,

Vol. 12, No. 1, January 30, 2018
10.3837/tiis.2018.01.024, Download Paper (Free):

• FHE
• privacy leakage
• untrusted server
• ciphertext calculability
• Parallel computing

Abstract

Fully homomorphic encryption(FHE) scheme may be the best method to solve the privacy leakage problem in the untrusted servers because of its ciphertext calculability. However, the existing FHE schemes are still not being put into the practical applications due to their low efficiency. Therefore, it is imperative to find a more efficient FHE scheme or to optimize the existing FHE schemes so that they can be put into the practical applications. In this paper, we optimize GSW scheme by using the parallel computing, and finally we get a high-performance FHE scheme, namely PGSW scheme. Experimental results show that the time overhead of the homomorphic operations in new FHE scheme will be reduced manyfold with the increasing of processing units number. Therefore, our scheme can greatly reduce the running time of homomorphic operations and improve the performance of FHE scheme through sacrificing hardware resources. It can be seen that our FHE scheme can catalyze the development of FHE.

Statistics

Cite this article