Access the full text.
Sign up today, get DeepDyve free for 14 days.
References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.
Voter coercion, such as vote buying, has been minimised for decades with the private voting booth. Cellphone videos, absentee ballots, voter receipts and internet voting re-introduce the possibility of coercion because they are methods to prove a vote. This article presents a mathematical model of the voting process to show that giving voters the option to re-vote removes this proof because an observed vote is not necessarily final. Re-voting can also be used to spot threats such as viruses and Trojan horses that subvert voting machines. Re-voting mechanisms require cryptography techniques to separate user identifiers from votes cast, enabling the system to track votes by time without providing the specific identity of the user or the details of the vote cast. Mix-nets and homomorphic encryption provide the necessary tools.
Electronic Government, an International Journal – Inderscience Publishers
Published: Jan 1, 2010
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.