Abstract
The secure and practical Internet voting protocols should have: privacy, completeness, soundness, unreusability, fairness, eligibility, and invariableness, universal verifiability, receipt-free, coercion-resistant. Research on the Internet voting protocol is focusing on the implementation of these properties without strong physical assumptions. In this paper, first, invariableness is proposed. Secondly, we analyze the typical protocols according to properties. Thirdly, we give an improvement of a famous Internet voting protocol. In the last we analyze it and prove that the improved protocol is receipt-free with Jonker-Vink receipt-freeness formal model.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
