e-Voting Protocol Modelling To Improve Verifiability Requirements
Teguh Nurhadi Suharsono, Gunawan, Rini Nuraini Sukmana · 2021
The ability of the voting system to protect voter votes until the end of the process can increase public confidence in the voting system. The verifiability aspect allows several parties to ensure that there is no change in the vote of the voters, thereby increasing trust in voting technology. To get to the concept of the proposed system of e-voting, an analysis e-voting needs has been carried out and the stage of the protocol model design analysis for verifiability needs. Some parties involved in meeting the needs of verifiability are Voters, Officers, Witnesses or KPU (Commission of General Election), where some parties can verify the votes of voters before, during, after, and after the vote count in election. In fulfilling the verifiability needs of this e-voting system, traditional simulation modeling and voting testing have been carried out as a comparison with modeling simulations and testing of e-voting protocols. Before modeling simulation and protocol testing, formal notation writing was carried out in the form of Communicating Sequential Processes (CSP) notation. Protocol testing will be carried out with formal verification, which proves that protocol specifications are in accordance with the integrity properties that have been defined previously. The verification tool used is based on reference modeling, which can analyze the specifications logical consistency, and verified properties reports, namely SPIN (Simple Promela Interpreter). The verified system used PROMELA language (MEta LAnguage process) which is translated from CSP formal notation.