FPF: Fraud Proof Framework for Electronic Voting System

Author(s):  
Innocent Kabandana ◽  
A.N. Nanda Kumar

In a democratic process voting plays a vital role in selection of policy as well as candidates. Voting though gives the freedom to voter to cast his opinion it is not free fraudulent. In order to have secure voting and convey the opinion of authorized voter in this paper we have presented a java based framework for fraud proof electronic voting system. In this framework we ensure that only the authorized voter is permitted to cast his vote and mitigate illegal voters cast votes on faking or pretending to be someone else. Proposed FPF provides a multi-level of authentication mechanism to validate the voter. The proposed system is tested for efficiency and robustness in comparing it with the existing system and is found to be efficient through comparative analysis. At present FPF is successful in mitigating the unauthorized voting further enhancement in the electronic voting system is being carried out as future work.

Author(s):  
Innocent Kabandana ◽  
A.N. Nanda Kumar

In a democratic process voting plays a vital role in selection of policy as well as candidates. Voting though gives the freedom to voter to cast his opinion it is not free fraudulent. In order to have secure voting and convey the opinion of authorized voter in this paper we have presented a java based framework for fraud proof electronic voting system. In this framework we ensure that only the authorized voter is permitted to cast his vote and mitigate illegal voters cast votes on faking or pretending to be someone else. Proposed FPF provides a multi-level of authentication mechanism to validate the voter. The proposed system is tested for efficiency and robustness in comparing it with the existing system and is found to be efficient through comparative analysis. At present FPF is successful in mitigating the unauthorized voting further enhancement in the electronic voting system is being carried out as future work.


2021 ◽  
Vol 7 (2) ◽  
pp. 102-109
Author(s):  
W. Salman

The analysis of the performance of two cryptographic algorithms (Paillier and Benaloh), in order to apply them in the construction of electronic voting systems is carried out. A description of each system and their homomorphic properties is given. Electronic voting systems based on these schemes are described. The requirements for the voting system are formulated and a comparative analysis of the voting systems based on the schemes of Paillier and Benaloh is carried out. The analysis showed that the Paillier scheme is the best and simplest method for building secure electronic voting systems, while the Benaloh scheme is more complex and computationally more time-consuming.


2019 ◽  
Author(s):  
Pranith H ◽  
Manoj Kumar M. V. ◽  
Sanjay H A ◽  
Prashanth B S ◽  
Likewin Thomas ◽  
...  

2018 ◽  
Vol Volume-2 (Issue-3) ◽  
pp. 1634-1637
Author(s):  
Anish. V ◽  
Balaji. M ◽  
Santhosh Kumar. S ◽  

Voting is important for any democratic country. It can be considered as one of the major factors that make a government for the people and by the people. The most common methods of voting that currently exist are ballot-based voting, purely electronic methods, and Electronic Voting Machines, among others. Over the years, it has been a challenge to build a secure E-voting program that provides the privacy of current voting systems while offering a means of accountability and versatility. Using blockchain technology and cryptography we can make the process of elections as open and cost-effective as possible. In this review paper we discuss a new, blockchain-based electronic voting system that addresses some of the limitations in existing systems and evaluates some of the popular systems designed to create a blockchain-based e-voting system.


Sign in / Sign up

Export Citation Format

Share Document