Review articleHomomorphic encryption systems statement: Trends and challenges
Introduction
For so long, security has been the most important feature that researchers try to provide while applying different methods and implementing different techniques. Recently, encryption has presented the most efficient method to apply in order to guarantee certain security, privacy, and protection to different existing systems. Moreover, homomorphic encryption [1], [2] got the major attention due to the uncountable advantages it offers. Homomorphic encryption, applied to public clouds [3], [4], [5], presents the concept of a service provider who can carry out different operations on encrypted data without the need to decrypt it beforehand. Therefore, this encryption technique is used in different systems, for different aims, it shows great adaptability and fitness while being implemented in various ways.
Homomorphic cryptosystems present a large application scope over the conventional cryptosystems, which explains clearly its tremendous utility. Even further, from a theoretical and practical point of view, there have been so many applications in numerous areas of security for cloud computation in general, that show terrific performance when using homomorphic cryptosystems with limited-depth techniques. Homomorphic schemes have the ability to solve some practical issues in cryptography in some use cases along with keeping data encrypted.
The following paper is a presentation of different related works based on homomorphic encryption as an encryptionmethod used in different fields [6], [7], [8]. It focuses, precisely, on a short abstract of every cryptosystem and the techniques combined with. The abstract of every system is a brief description of the problems faced, the adopted techniques and the use of the homomorphic encryption to solve that. This paper also defines the adopted mathematical model by enlisting the main mathematical steps (key generation, encryption, decryption, further mathematical operations needed on each cryptosystem, etc…).
The paper is organized as follows: Section 2 is a presentation of different surveys that are based on homomorphic encryption, an abstract and a mathematical model of every cryptosystem, this section is divided according to schemes specificities. Then Section 3, holds a comparative table between these systems giving the merits and the limitations for each technique. Finally, a conclusion is held in Section 4 in order to highlight which technique is the most adequate when it comes to imaging and securing images.
In summary, the main aim of this paper is to present a comparison table of the previously presented schemes relying on homomorphic encryption, and, we will conclude with the most adequate technique and the strongest scheme that can be applied in the medical field [9], [10] and images.
Section snippets
Related work
The following section is a presentation of the most known cryptosystems that are mainly based on homomorphic encryption. This section contains subsections assembling techniques with similar mathematical criteria. Below, a brief abstract and a description of the mathematical model for each technique.
Comparison table
Below a comparative table, presenting the different homomorphic encryption-based techniques by highlighting merits, limitations, and comments regarding each proposed approach (see Table 1).
Trends and challenges
The following paper is an in-depth study of the different uses and implementations of the homomorphic encryption in order to enhance the security and privacy goals of any cryptosystem. First, we presented the most relevant works in the literature and research on methods of ensuring security, confidentiality, and data protection has already made much progress, there are still some issues to consider. In order to better understand the directions of research in this area, we present in more detail
Conclusion
The following paper is an in-depth study of the different uses and implementations of the homomorphic encryption in order to enhance the security and privacy goals of any cryptosystem. First, we presented the most relevant works in the literature by highlighting the principles of the adopted scheme and then a brief description of the mathematical model for each work. All these cryptosystems were summarized in a comparative table, giving the advantages and the drawbacks for each technique.
Declaration of Competing Interest
The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.
Acknowledgments
This work is supported by Qassim University .
References (81)
- et al.
Homomorphic encryption for security of cloud data
- et al.
Efficient fully homomorphic encryption from RLWE with an extension to a threshold encryption scheme
J. Future Gener. Comput. Syst.
(2014) - et al.
CRT-based fully homomorphic encryption over the integers
Inform. Sci.
(2015) - et al.
Video salient region detection model based on wavelet transform and feature comparison
EURASIP J. Image Video Process.
(2019) - et al.
Application of Homomorphism to secure image sharing
Opt. Commun. J.
(2011) - et al.
A secure data routing schema for WSN using Elliptic Curve Cryptography and homomorphic encryption
J. King Saud Univ. - Comput. Inf. Sci.
(2016) - et al.
Survey of various homomorphic encryption algorithms and schemes
Int. J. Comput. Appl.
(2014) - et al.
A Guide To Fully Homomorphic Encryption’Cryptology ePrint Archive, Report 2015/1192
(2015) - et al.
Translating algorithms to handle fully homomorphic encrypted data on the cloud
IEEE Trans. Cloud Comput.
(2018) - et al.
Homomorphic encryption for security of cloud data
Procedia Comput. Sci.
(2016)