Talk · IEEE International Conference on Smart Information Systems and Technologies · May 15, 2024
Assessing Electoral Integrity: Paillier’s Partial Homomorphic Encryption in E-Voting System
Zeynep Galymzhankyzy, Ildar Rinatov, Aliya Abdiraman, Shynbolat Unaybaev
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.
Related publications
- ENHANCED INFORMATION SECURITY FOR VOTING SYSTEM IN EMERGENCIES USING PAILLIER’S CRYPTOSYSTEMScientific Journal of Astana IT University · 2025 · Same author: Zeynep Galymzhankyzy
- Optimizing E-Voting Systems: Integration of Paillier Cryptosystem and Parallel Processing for Enhanced Security and EfficiencyIEEE AITU: Digital Generation · 2024 · Citations: 2 · Same author: Zeynep Galymzhankyzy
- Elliptic curve-based enhancements of secure electronic voting protocols with zero-knowledge proofs and bit commitmentInternational Journal of Innovative Research and Scientific Studies · 2025 · Shared topic: Internet Traffic Analysis and Secure E-voting
- The ECTLC-Horcrux Protocol for Decentralized Biometric-Based Self-Sovereign Identity with Time-Lapse EncryptionInternational Journal of Advanced Computer Science and Applications · 2025 · Citations: 1 · Shared topic: Blockchain Technology Applications and Security