New Fully Homomorphic Encryption over the Integers

Gu Chunsheng

Abstract

We first present a fully homomorphic encryption scheme over the integers, which modifies the fully homomorphic encryption scheme in [vDGHV10]. The security of our scheme is merely based on the hardness of finding an approximate-GCD problem over the integers, which is given a list of integers perturbed by the small error noises, removing the assumption of the sparse subset sum problem in the origin scheme [vDGHV10]. Then, we construct a new fully homomorphic encryption scheme, which extends the above scheme from approximate GCD over the ring of integers to approximate principal ideal lattice over the polynomial integer ring. The security of our scheme depends on the hardness of the decisional approximate principle ideal lattice polynomial (APIP), given a list of approximate multiples of a principal ideal lattice. At the same time, we also provide APIP-based fully homomorphic encryption by introducing the sparse subset sum problem. Finally, we design a new fully homomorphic encryption scheme, whose security is based on the hardness assumption of approximate lattice problem and the decisional SSSP.

Available format(s)
Publication info
Published elsewhere. Unknown where it was published
Keywords
Fully Homomorphic EncryptionApproximate Lattice ProblemApproximate Principal Ideal LatticeApproximate GCDBDDPSSSP
Contact author(s)
guchunsheng @ gmail com
History
2011-07-09: last of 7 revisions
See all versions
Short URL
https://ia.cr/2011/118

CC BY

BibTeX

@misc{cryptoeprint:2011/118,
author = {Gu Chunsheng},
title = {New Fully Homomorphic Encryption over the Integers},
howpublished = {Cryptology ePrint Archive, Paper 2011/118},
year = {2011},
note = {\url{https://eprint.iacr.org/2011/118}},
url = {https://eprint.iacr.org/2011/118}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.