• Corpus ID: 220423847

A Survey on Homomorphic Encryption Schemes: Theory and Implementation

  title={A Survey on Homomorphic Encryption Schemes: Theory and Implementation},
  author={Abbas Acar and Hidayet Aksu and Arif Selcuk Uluagac and Mauro Conti},
  journal={arXiv: Cryptography and Security},
Legacy encryption systems depend on sharing a key (public or private) among the peers involved in exchanging an encrypted message. However, this approach poses privacy concerns. Especially with popular cloud services, the control over the privacy of the sensitive data is lost. Even when the keys are not shared, the encrypted material is shared with a third party that does not necessarily need to access the content. Moreover, untrusted servers, providers, and cloud operators can keep identifying… 

Figures and Tables from this paper

A Survey on Homomorphic Encryption Schemes

The basics of HE and the details of the well-known Partially Homomorphic Encryption and Somewhat Homomorphic encryption schemes, which are important pillars for achieving FHE, are presented and the implementations and recent improvements in Gentry-type FHE schemes are surveyed.

Cloud Storage Protection Scheme Based on Fully Homomorphic Encryption

A fully homomorphic encryption scheme for securing cloud data at rest based on prime modular operation, its security depends on factoring multiple large prime numbers up to n, which is formed from very large prime Numbers up to hundreds of digits as this is an open problem in mathematics.

Practical Privacy-Preserving Data Science With Homomorphic Encryption: An Overview

  • Michela Iezzi
  • Computer Science
    2020 IEEE International Conference on Big Data (Big Data)
  • 2020
This article focuses on how HE and data science can be leveraged to design and develop privacy-preserving enterprise applications and proposes a survey of main Homomorphic Encryption techniques and recent advances in the conubium between data science and HE.

Survey on Homomorphic Encryption and Address of New Trend

This article aims to introduce a literature survey to close the gap in homomorphic encryption systems and their applications in the protection of privacy and presents recommendations for future work.

Computing Blindfolded on Data Homomorphically Encrypted under Multiple Keys: A Survey

A comprehensive survey of the state-of-the-art multi-key techniques and schemes that target different systems and threat models based on a new secure outsourced computation model and examine their complexities.

Performance comparison of homomorphic encryption scheme implementations

This paper evaluated features and performances of several new homomorphic encryption mechanisms: BGV, BFV and CKKS.

A Searchable Encryption Scheme with Biometric Authentication and Authorization for Cloud Environments

A searchable encryption system that uses biometric authentication, such that an unauthorized user cannot submit search queries and the correctness and security proof of the operations gives the guarantee that the cloud servers return the correct documents.

Verifiable Homomorphic Encrypted Computations for Cloud Computing

This paper proposes a verification scheme based on the modular residue to validate homomorphic encryption computation over integer finite field to be used in cloud computing so that data confidentiality, privacy, and data integrity can be enforced during an outsourced computation.

A Detailed Survey of Fully Homomorphic Encryption Standards to Preserve Privacy over Cloud Communications

This paper gives an account of various homomorphic standards followed in cloud communications and summarizes the key facts and stats of these methods.

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.



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.

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.

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.

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.

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.

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.

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).