• 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
  • Mathematics, Computer Science
  • 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… 

Experiments on the Gentry-Halevi somewhat homomorphic scheme

  • M. Mikus
  • Mathematics, Computer Science
  • 2011
It is shown that the probability q significantly influences the overall effectiveness of the scheme and that the growth of the supported degree doesn’t grow linearly with the parameter t (strictly) and an explanation for this fact is given.

Fully Homomorphic Encryption: Overview and Cryptanalysis

The algorithms IdealGen and Samp remain abstract, but – roughly speaking – IdealGen constructs a secret and public basis for an ideal J coprime to the input ideal I and Samp(BI, x) samples the coset x+ I.

Experiments with the Plaintext Space in Gentry’S Somewhat Homomorphic Scheme

  • M. Mikus
  • Mathematics, Computer Science
  • 2012
The analysis shows that bigger plaintext space will improve the homomorphic computation of the somewhat homomorphic scheme while it only slightly increases the complexity of the key generation procedure.

On implementation of the Gentry-Halevi somewhat homomorphic scheme

We have implemented the somewhat homomorphic scheme from [7]. We examined this scheme in the same way as mentioned in [7] and extend the results for a wider set of parameters. We focused on the

Ciphertext-Only Attack on Gentry-Halevi Implementation of Somewhat Homomorphic Scheme

The first working implementation of a fully homomorphic scheme from C.Gentry and S.Halevi is examined and two improvements of this attack are proposed that enable us to use the fastest variant of LLL from NTL and compare the results.

AES (Advanced Encryption Standard) Based Cryptography for Data Security in Cloud Environment

  • Aastha Tiwari
  • Computer Science, Mathematics
    International Journal for Research in Applied Science and Engineering Technology
  • 2019
This research proposed a new algorithm called DSICE (Data Security in Cloud using Encryption), which encrypt the file using secure key, uploaded by the user at the cloud end and DSICD, which decrypt the file data using secureKey from the cloud at the other end.

Security and Privacy on Blockchain

This article presents a comprehensive overview of the security and privacy of blockchain with respect to concept, attributes, techniques, and systems, and describes the basic security properties that are supported as the essential requirements and building blocks for Bitcoin-like cryptocurrency systems.

Cloud Computing: Security and Reliability Issues

This work focuses on data-centric and homomorphic encryption methods that may provide more appropriate solutions in addressing the challenges in cloud computing security and reliability and argues that traditional techniques may not be efficient for use in cloud environments.

Experiments on the Gentry-Halevi somewhat homomorphic scheme

We have implemented the somewhat homomorphic scheme from (16). We examined this scheme in the same way as mentioned in (16) and extend the results for a wider set of parameters and also increased the



Fully Homomorphic Encryption over the Integers

A fully homomorphic encryption scheme, using only elementary modular arithmetic, that reduces the security of the scheme to finding an approximate integer gcd, and investigates the hardness of this task, building on earlier work of Howgrave-Graham.

Fully homomorphic encryption using ideal lattices

This work proposes a fully homomorphic encryption scheme that allows one to evaluate circuits over encrypted data without being able to decrypt, and describes a public key encryption scheme using ideal lattices that is almost bootstrappable.

Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages

A somewhat homomorphic encryption scheme that is both very simple to describe and analyze, and whose security reduces to the worst-case hardness of problems on ideal lattices using the RLWE assumption, which allows us to completely abstract out the lattice interpretation.

Fully Homomorphic Encryption without Bootstrapping

A new way of constructing leveled fully homomorphic encryption schemes (capable of evaluating arbitrary polynomial-size circuits), without Gentry’s bootstrapping procedure is presented, which dramatically improves performance and bases security on weaker assumptions.

Implementing Gentry's Fully-Homomorphic Encryption Scheme

A working implementation of a variant of Gentry's fully homomorphic encryption scheme, similar to the variant used in an earlier implementation effort by Smart and Vercauteren (PKC 2010), with a number of optimizations that allow it to implement all aspects of the scheme, including the bootstrapping functionality.

Faster Fully Homomorphic Encryption

Two improvements to Gentry’s fully homomorphic scheme based on ideal lattices are described: a more aggressive analysis of one of the hardness assumptions and a probabilistic decryption algorithm that can be implemented with an algebraic circuit of low multiplicative degree.

Trapdoors for hard lattices and new cryptographic constructions

A new notion of trapdoor function with preimage sampling, simple and efficient "hash-and-sign" digital signature schemes, and identity-based encryption are included.

Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes

This work presents a fully homomorphic encryption scheme which has both relatively small key and ciphertext size and allows efficient fully homomorphism over any field of characteristic two.

Lattice-based homomorphic encryption of vector spaces

A new probabilistic lattice-based bounded homomorphic encryption scheme that is able to preserve a vector spave structure of the message and the addition of ciphertexts is dramatically fast compared to homomorphic schemes based on group theory like Paillier or El Gamal.

Evaluating 2-DNF Formulas on Ciphertexts

A homomorphic public key encryption scheme that allows the public evaluation of ψ given an encryption of the variables x1,...,xn and can evaluate quadratic multi-variate polynomials on ciphertexts provided the resulting value falls within a small set.