Analysis and Comparison of Various Fully Homomorphic Encryption Techniques

Pratibha Chaudhary, Richa Gupta, Abhilasha Singh, Pramathesh Majumder

2019 International Conference on Computing, Power and Communication Technologies (GUCON) · 2019 · 17 citations · 7 references

Concepts

Abstract

Calculations can be carried out on encrypted form of data- is the essence of homomorphic encryption. Homomorphic encryption has resolved the security issues for storing data on the third-party systems (e.g. cloud or untrusted computer, service providers etc.). Most significant category of homomorphic encryption is fully homomorphic encryption. It permits unbounded number of operations on the encrypted form of data and output by system is within the ciphertext space. This paper provides the essentials of Homomorphic encryption and its various classifications i.e. partially homomorphic encryption, somewhat homomorphic encryption and fully homomorphic encryption. Mainly emphasizes on full homomorphic encryption and an investigation of different full homomorphic encryption schemes that uses the hardness of Ideal-lattice, integers, learning with error, elliptic curve cryptography based.

References

7