Corpus ID: 15012300

New Fully Homomorphic Encryption over the Integers

  title={New Fully Homomorphic Encryption over the Integers},
  author={Chunsheng Gu},
  journal={IACR Cryptol. ePrint Arch.},
  • Chunsheng Gu
  • Published 2011
  • Computer Science, Mathematics
  • IACR Cryptol. ePrint Arch.
  • 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… CONTINUE READING
    9 Citations
    Experiments with the Plaintext Space in Gentry’S Somewhat Homomorphic Scheme
    • 4
    • PDF
    Ciphertext-Only Attack on Gentry-Halevi Implementation of Somewhat Homomorphic Scheme
    Security and Privacy on Blockchain
    • 90
    • PDF
    Cloud Computing: Security and Reliability Issues
    • 19
    • PDF


    Fully Homomorphic Encryption over the Integers
    • 1,491
    • PDF
    Fully homomorphic encryption using ideal lattices
    • C. Gentry
    • Mathematics, Computer Science
    • STOC '09
    • 2009
    • 4,345
    • PDF
    Fully Homomorphic Encryption without Bootstrapping
    • 232
    • PDF
    Efficient Fully Homomorphic Encryption from (Standard) LWE
    • 1,304
    • PDF
    Implementing Gentry's Fully-Homomorphic Encryption Scheme
    • 833
    • PDF
    Faster Fully Homomorphic Encryption
    • 302
    • PDF
    Trapdoors for hard lattices and new cryptographic constructions
    • 1,570
    • PDF
    Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes
    • 735
    • PDF
    Lattice-based homomorphic encryption of vector spaces
    • 43
    • PDF