Cryptology ePrint Archive: Report 2011/121

More Practical Fully Homomorphic Encryption

Gu Chunsheng

Abstract: In this paper, we first modify the Smart-Vercauteren’s fully homomorphic encryption scheme [SV10] by applying self-loop bootstrappable technique. The security of the modified scheme only depends on the hardness of the polynomial coset problem, removing the assumption of the sparse subset sum problem in the original paper in [SV10]. Moreover, we construct a non-self-loop in FHE by using cycle keys. Then, we further improve our scheme to make it be practical. The securities of our improving FHE’s are respectively based on the hardness of factoring integer problem, solving Diophantine equation problem, and finding approximate greatest common divisor problem.

Category / Keywords: Fully Homomorphic Encryption, Polynomial Coset Problem, Factoring Integer, Diophantine Equation Problem, Approximate GCD, SSSP

Date: received 9 Mar 2011, last revised 16 Aug 2011

Contact author: guchunsheng at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20110817:021040 (All versions of this report)

Short URL: ia.cr/2011/121

Discussion forum: Show discussion | Start new discussion