• KSII Transactions on Internet and Information Systems
    Monthly Online Journal (eISSN: 1976-7277)

Fully Homomorphic Encryption Based On the Parallel Computing

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

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

Show / Hide Statistics

Statistics (Cumulative Counts from December 1st, 2015)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article

[IEEE Style]
Delin Tan and Huajun Wang, "Fully Homomorphic Encryption Based On the Parallel Computing," KSII Transactions on Internet and Information Systems, vol. 12, no. 1, pp. 497-522, 2018. DOI: 10.3837/tiis.2018.01.024

[ACM Style]
Tan, D. and Wang, H. 2018. Fully Homomorphic Encryption Based On the Parallel Computing. KSII Transactions on Internet and Information Systems, 12, 1, (2018), 497-522. DOI: 10.3837/tiis.2018.01.024