Receipt-free secret-ballot elections (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
Making Mix Nets Robust for Electronic Voting by Randomized Partial Checking
Proceedings of the 11th USENIX Security Symposium
A variant of the Chaum voter-verifiable scheme
WITS '05 Proceedings of the 2005 workshop on Issues in the theory of security
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
Secure Distributed Key Generation for Discrete-Log Based Cryptosystems
Journal of Cryptology
Advances in cryptographic voting systems
Advances in cryptographic voting systems
Split-ballot voting: everlasting privacy with distributed trust
Proceedings of the 14th ACM conference on Computer and communications security
Bare-handed electronic voting with pre-processing
EVT'07 Proceedings of the USENIX Workshop on Accurate Electronic Voting Technology
Three voting protocols: ThreeBallot, VAV, and twin
EVT'07 Proceedings of the USENIX Workshop on Accurate Electronic Voting Technology
Secret-Ballot Receipts: True Voter-Verifiable Elections
IEEE Security and Privacy
Human Readable Paper Verification of Prêt à Voter
ESORICS '08 Proceedings of the 13th European Symposium on Research in Computer Security: Computer Security
Analysis, improvement and simplification of Prêt à voter with Paillier encryption
EVT'08 Proceedings of the conference on Electronic voting technology
EVT'08 Proceedings of the conference on Electronic voting technology
An Epistemic Approach to Coercion-Resistance for Electronic Voting Protocols
SP '09 Proceedings of the 2009 30th IEEE Symposium on Security and Privacy
Receipt-free mix-type voting scheme: a practical solution to the implementation of a voting booth
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
Bingo voting: secure and coercion-free voting using a trusted random number generator
VOTE-ID'07 Proceedings of the 1st international conference on E-voting and identity
A practical voter-verifiable election scheme
ESORICS'05 Proceedings of the 10th European conference on Research in Computer Security
Prêt à voter with re-encryption mixes
ESORICS'06 Proceedings of the 11th European conference on Research in Computer Security
Single layer optical-scan voting with fully distributed trust
VoteID'11 Proceedings of the Third international conference on E-Voting and Identity
| Hi-index | 0.00 |
Recently, Xia et al. proposed a variant of Prêt à Voter which enjoys several attractive properties. Their protocol is among the few verifiable and receipt-free paper-based voting protocols resistant against randomization attacks. Trust is distributed among several authorities and the voter interface is relatively simple. Also, approval and ranked elections are supported. In this paper, we improve and simplify the protocol by Xia et al. Among others, we propose a simpler way of producing ballots, which only involves the encryption and re-encryption of candidate names; homomorphic encryption and proxy re-encryption are not needed. Also, no machine involved in the production of ballots needs to store a secret key. Moreover, unlike the protocol by Xia et al., in our protocol all authorities can be held accountable in case they misbehave in an observable way.