Analysis, improvement and simplification of Prêt à voter with Paillier encryption
EVT'08 Proceedings of the conference on Electronic voting technology
Coercion-resistant tallying for STV voting
EVT'08 Proceedings of the conference on Electronic voting technology
Minimum Disclosure Counting for the Alternative Vote
VOTE-ID '09 Proceedings of the 2nd International Conference on E-Voting and Identity
A Design of Secure Preferential E-Voting
VOTE-ID '09 Proceedings of the 2nd International Conference on E-Voting and Identity
Prêt à voter: a voter-verifiable voting system
IEEE Transactions on Information Forensics and Security - Special issue on electronic voting
Shuffle-sum: coercion-resistant verifiable tallying for STV voting
IEEE Transactions on Information Forensics and Security - Special issue on electronic voting
Pretty good democracy for more expressive voting schemes
ESORICS'10 Proceedings of the 15th European conference on Research in computer security
Parallel shuffling and its application to prêt à voter
EVT/WOTE'10 Proceedings of the 2010 international conference on Electronic voting technology/workshop on trustworthy elections
Prêt à Voter with Paillier encryption
Mathematical and Computer Modelling: An International Journal
Using Prêt à Voter in Victorian state elections
EVT/WOTE'12 Proceedings of the 2012 international conference on Electronic Voting Technology/Workshop on Trustworthy Elections
On the side-effects of introducing e-voting
VoteID'11 Proceedings of the Third international conference on E-Voting and Identity
Prêt à voter providing everlasting privacy
Vote-ID'13 Proceedings of the 4th international conference on E-Voting and Identity
| Hi-index | 0.00 |
Work on electronic voting systems to date has largely focused around first-past-the-post voting. However, the governments of many countries, and many non-governmental organisations, use a single transferable vote system, in which the voter needs to indicate not just a single preferred candidate but a preference ranking of (some or all of) the candidates on offer. This paper investigates the possibility of modifying Pret a Voter to cope with a single transferable vote system. With its newer form involving re-encryption mixes [8], this seems at first sight to be impossible; with the older version based on RSA onions [2], the obvious approach works, but security is less than ideal; using multiple re-encryption mix onions for each vote, combined with a lazy decryption semantics, however, proves to be an elegant and efficient solution to the problem.