Optimizing E-Voting Systems: Integration of Paillier Cryptosystem and Parallel Processing for Enhanced Security and Efficiency

Abstract

In the modern era, e-voting systems are pivotal in enhancing democratic processes. This research explores the application of the Paillier algorithm's Partial Homomorphic Encryption (PHE) in e-voting, prioritizing data security and voter anonymity to maintain the voting process's integrity and confidentiality. Using the Paillier cryptosystem in Python provides a secure, efficient, and scalable e-voting solution. Our model is compared with conventional and other homomorphic encryption methods, showcasing its superior security and efficiency, offering a viable option for improving elections. The importance of stringent security in e-voting systems is paramount. The Paillier Cryptosystem excels in safeguarding vote confidentiality and integrity thanks to its PHE capabilities. Yet, a significant challenge is the computational demand, especially in large-scale scenario elections where quickly processing millions of votes is critical.

Related publications

• ENHANCED INFORMATION SECURITY FOR VOTING SYSTEM IN EMERGENCIES USING PAILLIER’S CRYPTOSYSTEMScientific Journal of Astana IT University · 2025 · Same author: Zeynep Galymzhankyzy
• Assessing Electoral Integrity: Paillier’s Partial Homomorphic Encryption in E-Voting SystemIEEE International Conference on Smart Information Systems and Technologies · 2024 · Citations: 3 · 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