A Survey on Homomorphic Encryption Schemes

  title={A Survey on Homomorphic Encryption Schemes},
  author={Abbas Acar and Hidayet Aksu and Arif Selcuk Uluagac and Mauro Conti},
  journal={ACM Computing Surveys (CSUR)},
  pages={1 - 35}
Legacy encryption systems depend on sharing a key (public or private) among the peers involved in exchanging an encrypted message. [] Key Method First, we present the basics of HE and the details of the well-known Partially Homomorphic Encryption (PHE) and Somewhat Homomorphic Encryption (SWHE), which are important pillars for achieving FHE. Then, the main FHE families, which have become the base for the other follow-up FHE schemes, are presented.

Figures and Tables from this paper

A Survey of Various Cryptographic Techniques: From Traditional Cryptography to Fully Homomorphic Encryption

Traditional and modern cryptography techniques along with the different schemes of HE and FHE are focused on, which enables the cloud service provider to carry out computations on ciphered data without decrypting it.

A Survey on Privacy-Preserving Machine Learning with Fully Homomorphic Encryption

This survey presents a comprehensive review of theoretical concepts, state-of-the-art, limitations, potential applications, and development tools in the domain of FHE and identifies potential research directions to enrich Machine Learning as a Service, a new paradigm of cloud computing.

An improved Fully Homomorphic Encryption model based on N-Primes

A new mathematical model is developed and designed to achieve the characteristics of the Fully Homomorphic Encryption, which deals with the explicit text after converting it to the ASCII code instead of convertingIt to the binary system as it is in the existing systems, thus providing speed in the encryption process and returns the encryption.

An Overview on Homomorphic Encryption Algorithms

The concepts that support modern homomorphic encryption schemes, together with the description of some FHE schemes, are presented and some practical applications for processing sensitive data are presented.


  • V. KadykovA. Levina
  • Mathematics, Computer Science
    Vestnik komp'iuternykh i informatsionnykh tekhnologii
  • 2020
In this work, the possibility of using the ideal lattices for the construction of homomorphic operations is researched with a detailed level of math and the “remainder theorem” can be one of the principal ways to do this providing a simple estimate of an upper bound security strength of ciphertext structure.

Towards Secure Big Data Analysis via Fully Homomorphic Encryption Algorithms

It is aimed to anticipate how homomorphic encryption technology will be useful for secure Big Data processing, especially to improve the utility and performance of privacy-preserving machine learning.

Towards Converging Fully Homomorphic Batch Encryption with Data Integrity Assurance in Cloud Setting

This work brings in a fully Homomorphic Batch Encryption Scheme using Integers with Shorter public key (HBEIS) converged with integrity verification process in a cloud setting to address the problem of possessing the data in untrusted servers.

Analysis and Comparison of Various Fully Homomorphic Encryption Techniques

This paper provides the essentials of Homomorphic encryption and its various classifications and an investigation of different full homomorphic encryption schemes that uses the hardness of Ideal-lattice, integers, learning with error, elliptic curve cryptography based.

Cloud based private data analytic using secure computation over encrypted data

A A New Asymmetric Fully Homomorphic Encryption Scheme for Cloud Banking Data

The current research provides a new algorithm for a publicly-keyed encryption system to keep bank data from tampering and theft when stored on the cloud computing platform, and the new system achieves fully Homomorphic Encryption, which allows mathematical operations to be performed on the encrypted text without the need for the original text.



A Survey on Homomorphic Encryption Schemes: Theory and Implementation

The basics of HE and the details of the well-known Partially Homomorphic Encryption and Somewhat HomomorphicEncryption, which are important pillars of achieving FHE, are presented and the main FHE families, which have become the base for the other follow-up FHE schemes are presented.

Can homomorphic encryption be practical?

A proof-of-concept implementation of the recent somewhat homomorphic encryption scheme of Brakerski and Vaikuntanathan, whose security relies on the "ring learning with errors" (Ring LWE) problem, and a number of application-specific optimizations to the encryption scheme, including the ability to convert between different message encodings in a ciphertext.

State Of Art in Homomorphic Encryption Schemes

  • S. Ahila
  • Computer Science, Mathematics
  • 2014
This paper proposes a selection of the most important available solutions for homomorphic cryptosystems, discussing their properties and limitations.

A fully homomorphic encryption scheme

This work designs a somewhat homomorphic "boostrappable" encryption scheme that works when the function f is the scheme's own decryption function, and shows how, through recursive self-embedding, bootstrappable encryption gives fully homomorphic encryption.

Survey of Various Homomorphic Encryption algorithms and Schemes

This paper focuses on public key cryptographic algorithms based on homomorphic encryption scheme for preserving security and various homomorphic algorithms using asymmetric key systems such as RSA, ElGamal, Paillier algorithms as well as various homomorph encryption schemes such as BrakerskiGentry-Vaikuntanathan (BGV), Enhanced homomorphic Cryptosystem (EHC), Algebra homomorphicryption scheme based on updated ElGam al (AHEE).

Revisiting fully homomorphic encryption schemes and their cryptographic primitives

This thesis focuses on the security of fully homomorphic encryption schemes, and shows three different improvements of lattice reduction techniques that are able to accelerate the reduction form O(dβ + dβ) when the algorithm is dedicated for those cryptosystems.

On CCA-Secure Somewhat Homomorphic Encryption

This paper shows that the basic Gentry scheme is not IND-CCA1; indeed a trivial lunchtime attack allows one to recover the secret key and examines the security of the scheme against another security notion, namely security in the presence of ciphertext validity checking oracles; and shows why CCA-like notions are important in applications in which multiple parties submit encrypted data to the "cloud" for secure processing.

Practical Fully Homomorphic Encryption without Noise Reduction

  • Dongxi Liu
  • Computer Science, Mathematics
    IACR Cryptol. ePrint Arch.
  • 2015
A new fully homomorphic encryption (FHE) scheme that is efficient for practical applications and proved the hardness of recovering encryption keys from any number of ciphertexts with chosen plaintexts and then the semantic security of the scheme.

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.

Efficient public key Homomorphic Encryption over integer plaintexts

  • Y. RamaiahG. Kumari
  • Computer Science, Mathematics
    2012 International Conference on Information Security and Intelligent Control
  • 2012
The proposed Somewhat Homomorphic public key encryption scheme is compact, semantically secure with significantly smaller public key, and is capable of encrypting integer plaintexts rather than single bits, with comparatively lower message expansion and computational complexities.