Formal Verification of Blockchain and IoT-based E-Voting System Using SPIN

E-voting systems is great step toward maintaining democracy of countries because they are providing security, privacy, accessibility and fast countability. Blockchain and Internet of Things (IoT) increase further reliability because Blockchain makes voting more transparent and immutable. A mistake like alteration of results, miscounting and less privacy in system can cause huge loss of money, time, faith and effort of human beings. To tackle these errors our system must be correct. Therefore, we address problem related to correctness of e-voting system and try to ensure correctness using SPIN model checker by doing its formal verification. E-voting system are proposed with many different approaches in different studies and those system verifications are done using different model checking tools. But no one has used SPIN model checker in the area of e-voting system verification. In this work, we formally specify the e-voting system using the formal specification language, i.e., Process or Protocol Meta Language (PROMELA). We create a program graph for this process through the SPIN Model checker and describe safety properties using Linear Temporal Logic (LTL) in the form of a formula. The formal verification is performed to ensure correctness by giving the program graph and LTL formulas as input to the SPIN model checker to check whether the properties are satisfied with the program graph.