A verifiable secret shuffle and its application to e-voting
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Making Mix Nets Robust for Electronic Voting by Randomized Partial Checking
Proceedings of the 11th USENIX Security Symposium
Coercion-resistant electronic elections
Proceedings of the 2005 ACM workshop on Privacy in the electronic society
Coercion-Resistance and Receipt-Freeness in Electronic Voting
CSFW '06 Proceedings of the 19th IEEE workshop on Computer Security Foundations
L-diversity: Privacy beyond k-anonymity
ACM Transactions on Knowledge Discovery from Data (TKDD)
EVT'06 Proceedings of the USENIX/Accurate Electronic Voting Technology Workshop 2006 on Electronic Voting Technology Workshop
Advances in cryptographic voting systems
Advances in cryptographic voting systems
Helios: web-based open-audit voting
SS'08 Proceedings of the 17th conference on Security symposium
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
Coercion Resistant End-to-end Voting
Financial Cryptography and Data Security
Enhancing electronic voting machines on the example of Bingo voting
IEEE Transactions on Information Forensics and Security - Special issue on electronic voting
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 Game-Based Definition of Coercion-Resistance and Its Applications
CSF '10 Proceedings of the 2010 23rd IEEE Computer Security Foundations Symposium
USENIX Security'10 Proceedings of the 19th USENIX conference on Security
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
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
| Hi-index | 0.00 |
It is often argued in the e-voting community that in the presence of write-in candidates, forced abstention attacks are always possible. Therefore, write-in candidates are often excluded in existing definitions of coercion-resistance arguing that those definitions cannot be achieved by write-in supporting schemes. This is only true if the tally is made public directly. Coercion-resistance may well be achieved if only a fuzzy version of the tally is published. This paper provides a formalization of fuzzy tally representations which enables definitions for coercion-resistance to take into account write-in candidates without being weakened. We also show how the cryptographic voting scheme Bingo Voting can be applied to write-in candidates with respect to this formalization, providing what we believe to be the first e-voting scheme that prevents forced abstention while allowing for write-in candidates. We then give a general construction of coercion-resistant schemes that provide a verifiable fuzzy tally representation from mix-based and homomorphic election schemes with trusted authority.