# Survey of Various Homomorphic Encryption algorithms and Schemes

@article{Parmar2014SurveyOV, title={Survey of Various Homomorphic Encryption algorithms and Schemes}, author={Payal Parmar and Shraddha B. Padhar and Shafika N. Patel and Niyatee I. Bhatt and Rutvij H. Jhaveri}, journal={International Journal of Computer Applications}, year={2014}, volume={91}, pages={26-32} }

Homomorphic encryption is the encryption scheme which means the operations on the encrypted data. Homomorphic encryption can be applied in any system by using various public key algorithms. When the data is transferred to the public area, there are many encryption algorithms to secure the operations and the storage of the data. But to process data located on remote server and to preserve privacy, homomorphic encryption is useful that allows the operations on the cipher text, which can provide…

## 95 Citations

New Fully Homomorphic Encryption Scheme Based on Multistage Partial Homomorphic Encryption Applied in Cloud Computing

- Computer Science, Mathematics2018 1st Annual International Conference on Information and Sciences (AiCIS)
- 2018

The paper builds up a hybrid homomorphic encryption scheme based on the GM encryption algorithm which is additively (single bit) homomorphic, and RSAgorithm which is multiplicative homomorphic which lead to increase the speed, reduce the computation time, and enhance confidentiality of the data that is stored in the cloud by enhancing security.

Analysis and Comparison of Various Fully Homomorphic Encryption Techniques

- Computer Science, Mathematics2019 International Conference on Computing, Power and Communication Technologies (GUCON)
- 2019

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.

Survey on Homomorphic Encryption and Address of New Trend

- Computer Science, Mathematics
- 2020

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.

A Survey on Homomorphic Encryption Schemes

- Computer Science, MathematicsACM Comput. Surv.
- 2018

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.

A Survey on Homomorphic Encryption Schemes: Theory and Implementation

- Computer Science, Mathematics
- 2017

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.

Homomorphic cloud computing scheme based on hybrid homomorphic encryption

- Computer Science2017 3rd IEEE International Conference on Computer and Communications (ICCC)
- 2017

A hybrid cloud computing scheme based on the Paillier algorithm, and RSA encryption algorithm which is multiplicative homomorphic is developed, and the results show that the scheme is practical and efficient.

Big Data Privacy Using Fully Homomorphic Non-Deterministic Encryption

- Computer Science, Mathematics2017 IEEE 7th International Advance Computing Conference (IACC)
- 2017

The proposed encryption algorithm computes more than one mathematical operation on encrypted numerical data thereby further protecting the encrypted sensitive information.

Computing on Encrypted Data into the Cloud Though Fully Homomorphic Encryption

- Computer Science, Mathematics
- 2017

This work proposes a platform based on open source solutions to perform data computations (addition and multiplication) on encrypted form and studies the most popular partially homomorphic encryption algorithms to compromise between performance and security.

FHE Implementation of Data in Cloud Computing

- Computer Science, Mathematics
- 2017

The homomorphic encryption plays a significant role in cloud computing because the encrypted information of corporations is keep in a very public cloud, therefore taking advantage of the cloud provider’s services.

A Comparative Study on Homomorphic Encryption Schemes in Cloud Computing

- Computer Science, Mathematics2018 3rd IEEE International Conference on Recent Trends in Electronics, Information & Communication Technology (RTEICT)
- 2018

A security system using fully homomorphic encryption to secure medical data in the cloud is proposed, which will try to ensure security to the data even while processing it with better performance.

## References

SHOWING 1-10 OF 44 REFERENCES

A algorithm of fully homomorphic encryption

- Computer Science, Mathematics2012 9th International Conference on Fuzzy Systems and Knowledge Discovery
- 2012

In the paper, the interrelated technique is discribed and a modified ElGamal Encryption is introduced that can meet multiplicative homomorphism and additive homomorphicism and advance security.

Non-interactive Exponential Homomorphic Encryption Algorithm

- Mathematics, Computer Science2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery
- 2012

The concept of exponential homomorphism is presented and an exponential homomorphic encryption algorithm based on RSA is proposed that can encrypt coefficients and exponents of polynomial functions, hide the skeleton of the encrypted polyn coefficients, and implement non-interactive evaluation of encrypted exponential functions and polynometric functions.

ON DATA BANKS AND PRIVACY HOMOMORPHISMS

- Computer Science, Mathematics
- 1978

It appears likely that there exist encryption functions which permit encrypted data to be operated on without preliminary decryption of the operands, for many sets of interesting operations.

Improving Additive and Multiplicative Homomorphic Encryption Schemes Based on Worst-Case Hardness Assumptions}

- Computer Science, MathematicsIACR Cryptol. ePrint Arch.
- 2011

This paper presents an alternative construction allowing to compute products with polynomiallymany operands while preserving the security reductions of the initial scheme, and indicates that this construction seems to be incompatible with Gentry’s seminal transformation allowing to obtain fully-homomorphic encryption schemes.

Computing Aggregation Function Minimum/Maximum using Homomorphic Encryption Schemes in Wireless Sensor Networks (WSNs)

- Computer Science, MathematicsICWN
- 2007

It is shown how aggregation function minimum/maximum can be computed at the aggregator node in WSNs by performing addition operation and not comparison operation on the data encrypted with homomorphic encryption schemes.

Homomorphic Encryption Scheme of the Rational

- Mathematics, Computer Science2006 International Conference on Wireless Communications, Networking and Mobile Computing
- 2006

A new operation is defined - similar modul, the number sets of the homomorphic encryption scheme is extended to rational, and the possible operators are extended to addition, subtraction, multiplication and division.

An Efficient Secure Message Transmission in Mobile Ad Hoc Networks using Enhanced Homomorphic Encryption Scheme

- Computer Science
- 2013

A new scheme for secure transmission of message in MANETs is proposed as Alternative scheme for DF’s new Ph and DF”s additive and multiplicative PH and the computational cost of the homomorphic encryption schemes is provided.

Simulation Study Based on Somewhat Homomorphic Encryption

- Computer Science, Mathematics
- 2014

This paper presents the relationship between the length of plaintext and ciphertext size and the Gentry’s Somewhat Homomorphic Encryption scheme for the simulation research, in clear text size within a certain range simulation.

On the Security of a Modified Paillier Public-Key Primitive

- Computer Science, MathematicsACISP
- 2002

It is proved that the one-wayness of the M-Paillier cryptosystem is as intractable as factoring the modulus n, if the public key g can be generated only by the public modulus g and that the oracle that can generate the public-key factors themodulus n.

Information Security and Privacy, 11th Australasian Conference, ACISP 2006, Melbourne, Australia, July 3-5, 2006, Proceedings

- Computer Science, MathematicsACISP
- 2006

The Role of the Self-Defending Object Concept in Developing Distributed Security-Aware Applications and Efficient and Provably Secure Multi-receiver Identity-Based Signcryption are discussed.