With the increased need for data confidentiality in different applications of our daily life, homomorphic encryption (HE) arises as a promising cryptographic topic. HE allows to perform computations directly on encrypted data (ciphertexts) without decryption in advance. Since the results of calculations remain encrypted and can only be decrypted by the data owner, confidentiality is warranted and any third party can operate on ciphertexts without access to decrypted data (plaintetxts). Applying a homomorphic cryptosystem in a real-world application depends on its resource efficiency. Several works compared different HE schemes and gave the stakes of this research field. However, the existing articles either do not deal with recently proposed HE schemes (such as CKKS) or focus only on one type of HE. Within the context of the BI4people project (Business intelligence for the people), our objective is to conduct an extensive comparison and evaluation of homomorphic cryptosystems’ performance based on their experimental results. This evaluation aims to explore, analyze, and compare existing solutions to ata confidentiality problem using Homomorphic Encryption, followed by proposing the most appropriate and sufficient solution for BI4people. Moreover, he obtained results of performance evaluation can also be used to a variety of other situations. The study covers all three families of HE, including several otable schemes such as BFV, BGV, CKKS, RSA, El-Gamal, and Paillier. In addition, we present the basics of the HE schemes, in a great part of their principles and mathematical models, as well as their implementation specification in most-used HE libraries, namely Microsoft SEAL, PALISADE, and HElib.