Secure Electoral Voting System Using Homomorphic Encryption
The integrity of electoral systems is paramount in ensuring democratic processes. This paper explores the use of homomorphic encryption (HE) in electoral voting systems, providing a robust solution for maintaining voter privacy while enabling transparent and verifiable vote tallying. The study delves into cryptographic protocols such as Paillier and ElGamal encryption schemes, emphasizing their mathematical foundations and applicability to voting systems. The proposed system architecture integrates HE to achieve secure and efficient vote tallying. This paper also discusses the challenges and potential solutions associated with implementing HE in large-scale elections, followed by a detailed analysis of results and conclusions.
Authors
- Abhinav Saxena (ORCID: https://orcid.org/0000-0001-5001-218X)
- Vinayak Musale (ORCID: https://orcid.org/0000-0002-7155-1841)
- Amruta Amune (ORCID: https://orcid.org/0000-0002-5628-0721)
- Anand Bhongale
- Chhavikant Mahobia
- Sarthak Panse
Institutions
- MIT World Peace University (IN)
Publication Details
- Published
- 2024-12-06
- DOI
- https://doi.org/10.1109/ccis63231.2024.10932066
- Citations
- 1
- Primary Topic
- Internet Traffic Analysis and Secure E-voting
- Type
- article
- Field-Weighted Citation Impact
- 0.35