Using Homomorphic Cryptographic Solutions on E-voting Systems

HomomorphicCryptography raised as a new solution used in electronic voting systems.In this research, Fully Homomorphic encryption used to design and implement an e-voting system.The purpose of the study is to examine the applicability of Fully Homomorphic encryption in real systems and to evaluate the performance of fully homomorphic encryption in evoting systems.Most of homomorphic cryptography evoting systems based on additive or multiplicative homomorphic encryption.In this research, fully homomorphic encryption used to provide both operations additive and multiplication, which ease the demonstration of none interactive zero-knowledge proof NIZKP.The proposed e-voting system achieved most of the important security issues of the internet-voting systems such as eligibility, privacy, accuracy, verifiability, fairness, and others.One of the most important properties of the implemented internet voting system its applicability to work on cloud infrastructure, while preserving its security characteristics.The implementation is done using homomorphic encryption library HELib.Addition and multiplication properties of fully homomorphic encryption were used to verify the correctness of vote structure as a NIZKP, and for calculating the results of the voting process in an encrypted way.The results show that the implemented internet voting system is secure and applicable for a large number of voters up to 10 million voters.