A Formal Logic Framework for Receipt-freeness in Internet Voting Protocol

Abstract

<p class="MsoNormal" style="text-align: left; margin: 0cm 0cm 0pt; layout-grid-mode: char;" align="left"><span class="text"><span style="font-family: ";Arial";,";sans-serif";; font-size: 9pt;">The practical Internet voting protocols should have: privacy, completeness, soundness, unreusability, fairness, eligibility, and invariableness, universal verifiability, receipt-freeness, coercion-resistant. Receiptfreeness is a key property. Receipt-freeness means that the voter can't produce a receipt to prove that he votes a special ballot. Its purpose is to protect against vote buying. Formal method is an important tool to assess receipt-freeness of Internet voting protocols. In this paper we give a formal logic framework for receipt-freeness based on V. Kessler and H. Neumann logic. The framework is then applied to analyze receipt-freeness of two typical voting protocols: FOO and Meng Internet voting protocol.</span></span><span style="font-family: ";Arial";,";sans-serif";; font-size: 9pt;"></span></p>