
Securing Data in the cloud based on Fully Homomorphic Encryption (FHE) is a new and potential form of security that allows computing on encrypted data without decrypted it first. However, a practical FHE solution is not available for implementation today. In this work, we propose a platform based on open source solutions to perform data computations (addition and multiplication) on encrypted form. In addition, taking account of efficiently and the security component, the most popular partially homomorphic encryption algorithms (RSA, Paillier and ElGamal) are studied to analyze the process times of encryption, decryption and computation of each algorithm. Furthermore, to compromise between performance and security, we need to study different key sizes and different data sizes as parameters.
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 1 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
