• Corpus ID: 1467571

Somewhat Practical Fully Homomorphic Encryption

  title={Somewhat Practical Fully Homomorphic Encryption},
  author={Junfeng Fan and Frederik Vercauteren},
  journal={IACR Cryptol. ePrint Arch.},
In this paper we port Brakerski’s fully homomorphic scheme based on the Learning With Errors (LWE) problem to the ring-LWE setting. [...] Key Method We provide a detailed, but simple analysis of the various homomorphic operations, such as multiplication, relinearisation and bootstrapping, and derive tight worst case bounds on the noise caused by these operations. The analysis of the bootstrapping step is greatly simplified by using a modulus switching trick. Finally, we derive concrete parameters for which the…Expand
TOTA: Fully Homomorphic Encryption with Smaller Parameters and Stronger Security
  • Zhaomin Yang, Xiang Xie, Huajie Shen, Shiying Chen, Jun Zhou
  • Computer Science
    IACR Cryptol. ePrint Arch.
  • 2021
A new and efficient functional bootstrapping algorithm is presented that avoids the negacyclicity constraint of the evaluated functions, which enables us to extract bits blocks homomorphically and could be applied to BFV and TFHE schemes as well.
A Note on Ring-LWE Security in the Case of Fully Homomorphic Encryption
The security of Ring-LWE as found in Fully Homomorphic Encryption (FHE) schemes is discussed, the specificities of this case are presented, and a new special-purpose attack is derived.
Which Ring Based Somewhat Homomorphic Encryption Scheme is Best?
This paper compares side-by-side the NTRU and BGV schemes in their non-scale invariant messages in the lower bits, and their scale invariant message in the upper bits forms, and finds that the BGV scheme appears to be more efficient for large plaintext moduli, whilst YASHE seems moreefficient for small plain Text moduli although the benefit is not as great as one would have expected.
A Comparison of the Homomorphic Encryption Schemes FV and YASHE
We conduct a theoretical and practical comparison of two Ring-LWE-based, scale-invariant, leveled homomorphic encryption schemes – Fan and Vercauteren’s adaptation of BGV and the YASHE scheme
Cryptanalysis of Chosen Symmetric Homomorphic Schemes
Since Gentry’s breakthrough result was introduced in the year 2009, the homomorphic encryption has become a very popular topic. The main contribution of Gentry’s thesis was, that it has proven, that
Efficient Homomorphic Conversion Between (Ring) LWE Ciphertexts
New conversion algorithms that switch between different (R)LWE-based HE schemes to take advantage of the hardness of the Learning With Errors (LWE) problem or its ring variant (RLWE) are presented.
Homomorphic Encryption without Gaussian Noise
This work proposes a Somewhat Homomorphic Encryption (SHE) scheme based on the Learning With Rounding (LWR) problem, which provides lower ciphertext sizes for small plaintext spaces than existing leading schemes such as BGV.
Fully homomorphic encryption must be fat or ugly?
It is proved that fully homomorphic schemes are impossible for several algebraic structures, and a conjecture stating that secure FHE schemes must either have a significant ciphertext expansion or use unusual algebraic structure is proposed.
Symmetric Somewhat Homomorphic Encryption over the Integers
We describe a symmetric variant of homomomorphic encryption scheme by van Dijk et al. [DGHV10], semantically secure under the error-free approximate-GCD problem. We also provide the implementation of
Practical Parameters for Somewhat Homomorphic Encryption Schemes on Binary Circuits
A thorough study of two schemes that have proven their worth: FV and SHIELD is presented, providing a deep analysis of how to setup and size their parameters, to ensure both correctness and security.


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.
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 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 over the Integers with Shorter Public Keys
It is shown that fully homomorphic encryption can be implemented using simple arithmetic operations, and some optimizations from the recent Gentry-Halevi implementation of Gentry's scheme are obtained, roughly the same level of efficiency.
(Leveled) fully homomorphic encryption without bootstrapping
A novel approach to fully homomorphic encryption (FHE) that dramatically improves performance and bases security on weaker assumptions, using some new techniques recently introduced by Brakerski and Vaikuntanathan (FOCS 2011).
Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
A new tensoring technique for LWE-based fully homomorphic encryption that uses the same modulus throughout the evaluation process no need for "modulus switching", and this modulus can take arbitrary form.
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.
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.
Fully homomorphic SIMD operations
It is shown that the SIMD operations can be used to perform the recrypt procedure in parallel, resulting in a substantial speed-up, and this somewhat homomorphic scheme can be made fully homomorphic in a naive way by recrypting all data elements separately.
Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits
  • Craig Gentry, S. Halevi
  • Computer Science, Mathematics
    2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
  • 2011
A new blueprint for FHE is described, showing how to eliminate the squashing step, and thereby eliminate the need to assume that the sparse subset sum problem (SSSP) is hard, as all previous leveled FHE schemes have done.