Analysis of Internet Voting Protocols with Jonker-Vink Receipt-Freeness Formal Model

Abstract

The secure and practical Internet voting protocols should have: privacy, completeness, soundness, unreusability, fairness, eligibility, and invariableness, universal verifiability, receipt-freeness, coercion- resistant. At present the hot point is receipt-freeness. In the last twenty years a lot of protocols have been proposed. Formal method is the key to assess receipt- freeness of these protocols. But the receipt-freeness of many Internet voting protocols is analyzed without formal method. In this paper, first, we survey receipt- freeness. Secondly, we analyze several typical protocols with Jonker-Vink receipt-freeness formal model. According to the result of analysis we point out that the several typical protocols are not receipt- freeness.