Efficient Ballot Casting in Ranked Based Voting System Using Homomorphic Encryption

Abstract

Elections conducted on paper consumes many resources. Online voting system is very faster, cheaper and more suitable. Recent in online voting system improve the security guarantees for elections, because of confidentiality of voters and their integrity and validity. For security purpose, three election models are used for online voting: the mix-net model, the blind signature model, and the homomorphic encryption model. However only homomorphic encryption gives direct tallying without decrypting every votes. In this paper, we are focusing on ballot casting and tallying for ranked based voting system using Paillier homomorphic and Elgamal homomorphic encryption schemes and at the end we will compare results of both encryption schemes.