Assessing Electoral Integrity: Paillier’s Partial Homomorphic Encryption in E-Voting System

2024

Closed access Metadata (CSL-JSON)
DOI 10.1109/sist61555.2024.10629522
Data confidence 85 high
How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

Abstract

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.