THE MODELLING OF E-VOTING PROTOCOL IN IMPROVING VERIFIABILITY

• Main Author: Nurhadi Suharsono, Teguh
• Format: Dissertations
• Language: Indonesia
• Online Access: https://digilib.itb.ac.id/gdl/view/46677
• Institution: Institut Teknologi Bandung

Voting has become an essential part of the democratic system, both to make choices regarding policies, to choose representatives who will sit in representative assemblies, and to elect leaders. More and more voters and the extent of their distribution, the more complex aspects of social life, and the need to manage the voting process efficiently and the determination of results more quickly, e-Voting is a more promising choice. The level of trust in collection depends on the ability of the system to protect the voice of voters until the end of the process. The parameters in e-Voting consist of accuracy, invulnerability, privacy, and Verifiability. The Verifiability aspect is one of the parameters in eVoting that can increase trust in voting technology, where some parties can ensure that there is no change in votes from voters. The stages of analysis of the requirements of e-Voting and design of the protocol model for Verifiability requirements have been carried out towards the proposed e-Voting system concept. Some parties involved in fulfilling Verifiability needs are Voters, Officers, Witnesses and KPU (General Election Commission), where some parties can verify the voters' vote before the election, during the election, after the election, and after the vote count. In meeting the Verifiability requirements of the e-Voting system, traditional voting protocol modeling simulations have been carried out in comparison with the e-Voting protocol modeling simulation. Before the protocol modeling simulation, the formal notation was written in the form of Communicating Sequential Processes (CSP) notation. Protocol verification will be carried out with formal verification, which proves that the protocol specifications conform to previously defined integrity properties. This verification has achieved by using a verification tool based on modeling references, namely SPIN (Simple Promela Interpreter) that can analyze the logical consistency of specifications, and reports about verified properties. The verified system has modeled with the language PROMELA (PROcess MEta LAnguage) which has translated from CSP formal notation. In this study, besides producing e-Voting protocol for Verifiability requirements, the proposed Individual Verifiability, Universal Verifiability, End-to-End Verifiability integration method also produced Verifiability metrics to measure the degree of Verifiability of an e-Voting protocol, the prototype for the implementation of protocol e-Voting with Verifiability requirements and evaluating the prototype e-Voting protocol. The results of measuring the degree of verifiability in the proposed protocol show an increase in verifiability compared to traditional voting protocols and other e-voting protocols. In addition to measuring the degree of verifiablity, the value of the degree of anonymity is also obtained by 1, which is the maximum value for the degree of anonymity, so that the proposed protocol can increase verifiability and can also maintain anonymity.