A Homomorphic Encryption Approach in a Voting System in a Distributed Architecture

It is considered that Electronic Votes is an alternative of safer systems, which provides greater confidence and transparency to the general public, but the problems exist in the organisms that manage this process. The main objective is to describe the Homomorphic encryption, understand why this algorithm is the basis for different schemes mentioned in the document. There are several implementations of homomorphic properties that generate the possibility to continue analyzing the different encryption schemes and application areas as visualized in electronic voting. We use the deductive methodology, logical analytics, and exploratory research to analyze the description of three schemes that have a Homomorphic base. It is a basis for properly selecting a homomorphic scheme that fits a specific need. It is concluded that the homomorphic schemes presented in this analysis have different uses of algorithms, but they do not leave behind the efficiency that all present, at the same time the reference is made to a distributed architecture that helps to have an additional point when dealing with the information obtained in electoral.