Verification of Verifiability of Voting Protocols by Strand Space Analysis
Shigeki Hagihara, Masaya Shimakawa, Naoki Yonezaki · 2019
With the widespread adoption of electronic voting, various voting protocols have been proposed. Voting protocols need to satisfy security requirements, including privacy protection and the prevention of illegal voting (e.g., double voting). Our research focuses on the most important property of voting protocols, namely whether all votes are reflected in the voting results accurately. We formalized and verified this for one voting protocol using strand space analysis. We can also consider multiple security requirements depending on the extent to which the voting result is reflected accurately. These properties are discussed.