Assessing Electoral Integrity: Paillier’s Partial Homomorphic Encryption in E-Voting System
Zeynep Galymzhankyzy, Ildar Rinatov, Aliya Abdiraman, Shynbolat Unaybaev · 2024
In today’s digital age, electronic voting systems are at the forefront of advancing democratic practices. This study delves into the use of the Paillier algorithm’s Partial Homomorphic Encryption (PHE) properties within an electronic voting framework. With a strong emphasis on safeguarding data security and ensuring voter anonymity, the proposed model upholds the integrity and confidentiality of the voting process. The implementation of the Paillier cryptosystem in Python offers a secure, efficient, and scalable solution for e-voting. A thorough comparison with traditional and other homomorphic encryption methods highlights the superior security and computational efficiency of our approach, making it a promising avenue for enhancing the electoral process.