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.

Full Text
Paper version not known

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.