How to prove yourself: practical solutions to identification and signature problems
Proceedings on Advances in cryptology---CRYPTO '86
Wallet Databases with Observers
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Receipt-Free Electronic Voting Schemes for Large Scale Elections
Proceedings of the 5th International Workshop on Security Protocols
Guaranteed Correct Sharing of Integer Factorization with Off-Line Shareholders
PKC '98 Proceedings of the First International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
The Decision Diffie-Hellman Problem
ANTS-III Proceedings of the Third International Symposium on Algorithmic Number Theory
Incoercible multiparty computation
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Coercion-resistant electronic elections
Proceedings of the 2005 ACM workshop on Privacy in the electronic society
Scratch & vote: self-contained paper-based cryptographic voting
Proceedings of the 5th ACM workshop on Privacy in electronic society
Implementing STV securely in Pret a Voter
CSF '07 Proceedings of the 20th IEEE Computer Security Foundations Symposium
Three voting protocols: ThreeBallot, VAV, and twin
EVT'07 Proceedings of the USENIX Workshop on Accurate Electronic Voting Technology
FC'05 Proceedings of the 9th international conference on Financial Cryptography and Data Security
A practical voter-verifiable election scheme
ESORICS'05 Proceedings of the 10th European conference on Research in Computer Security
Receipt-free universally-verifiable voting with everlasting privacy
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Efficient binary conversion for paillier encrypted values
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
TCC'06 Proceedings of the Third conference on Theory of Cryptography
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
Practical remote end-to-end voting scheme
EGOVIS'11 Proceedings of the Second international conference on Electronic government and the information systems perspective
Coercion-resistant electronic elections with write-in candidates
EVT/WOTE'12 Proceedings of the 2012 international conference on Electronic Voting Technology/Workshop on Trustworthy Elections
Practical Internet voting system
Journal of Network and Computer Applications
Formal model-based validation for tally systems
Vote-ID'13 Proceedings of the 4th international conference on E-Voting and Identity
A game-based definition of coercion resistance and its applications
Journal of Computer Security - CSF 2010
| Hi-index | 0.00 |
There are many advantages to voting schemes in which voters rank all candidates in order, rather than just choosing their favourite. However, these schemes inherently suffer from a coercion problem when there are many candidates, because a coercer can demand a certain permutation from a voter and then check whether that permutation appears during tallying. In this paper, we solve this problem for the popular STV system, by constructing an algorithm for the verifiable tallying of encrypted votes. Our construction improves upon existing work because it extends to multiple-seat STV and reveals less information than other schemes.