A Formal Logic Framework for Receipt-freeness in Internet Voting Protocol
|
| Title | A Formal Logic Framework for Receipt-freeness in Internet Voting Protocol |
| Authors | |
| Abstract | 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 cant 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. |
| Publisher | ACADEMY PUBLISHER |
| Date | 2009-03-01 |
| Source | Journal of Computers Vol 4, No 3 (2009): Special Issue: Selected Best Papers of WKDD 2008 - Track on Innovative Computin |
| Rights | Copyright © ACADEMY PUBLISHER - All Rights Reserved.To request permission, please check out URL: http://www.academypublisher.com/copyrightpermission.html. |