In response to a system design concept, a question was posed:
How do you achieve electronic voting, anonymity, and verifiability at the same time?
I was informed that most experts in the field believe it to be practically impossible (see Jonker et al.). My understanding was that this was solved through systems such as Civitas and its secure language Jif.
My questions are:
- Are e-voting systems having anonymity and verifiability with high coercion-resistance possible?
- What are the findings from latest research?
- What are the most reputable journals in this field of study?
- Optionally, how do homomorphic encryption and zero knowledge proofs relate to anonymity?
I have read a fair amount, but do not wholly understand the implications. Nor am I certain that I have found the latest research on this subject.
- Privacy and verifiability in voting systems: Methods, developments and trends
- An efficient multi-receipt mechanism for uncoercible anonymous electronic voting
- Pseudo-Voter Identity (PVID) Scheme for e-Voting Protocols
- Election Verifiability in Electronic Voting Protocols
- Coercion-resistance and receipt-freeness in electronic voting
- Receipt-Free Homomorphic Elections and Write-in Voter Verified Ballots
- Multiplicative homomorphic e-voting
- A homomorphic encryption-based secure electronic voting scheme
- A Secure and Anonymous Electronic Voting Scheme Based on Key Exchange Protocol
- A Receipt-free Coercion-resistant Remote Internet Voting Protocol without Physical Assumptions through Deniable Encryption and Trapdoor Commitment Scheme