> some straightforward cryptographic scheme
Anybody who designs cryptographic systems is LOLing right now.
> some straightforward cryptographic scheme
Anybody who designs cryptographic systems is LOLing right now.
* Every registered voter gets an encryption key
* When you vote, your vote is encrypted with the key
* A list of everyone who voted, along with their encrypted vote, is semi-publicly available (like current voter registration lists [1])
* Anyone can check who they're registered as having voted for (but the encryption keeps it private)
* Anyone who wants to verify the election results can request the voter registration list, and ask some randomly sampled subset to verify their vote
[1] https://www.ncsl.org/research/elections-and-campaigns/access...
There are zero-knowledge cryptographic constructions that may theoretically allow you to prove things to a voter without allowing them to prove it to others. But doing this in practice with voters who aren’t cryptographers, and whose personal devices get hacked and stolen, has proved to be a difficult problem.
There are paper-based cryptographic systems for end-to-end verifiable elections. There are no personal devices to hack or steal in such systems.
See the links in this comment https://news.ycombinator.com/item?id=31675726
https://www.usenix.org/legacy/event/sec08/tech/full_papers/a...
The secret ballot, also known as the Australian ballot, is a voting method in which a voter's identity in an election or a referendum is anonymous. This forestalls attempts to influence the voter by intimidation, blackmailing, and potential vote buying. This system is one means of achieving the goal of political privacy.
This opens it to risk of bribery and coercion.
Right now, you can prove that you voted, but not actually how you voted.
Ron Rivest and David Chaum are rather well known designers of cryptographic systems, and I don't think they would LOL at crytographic voting schemes considering that they have designed one [1].