3 ms·
Here's one way to do it that requires basically zero trust in the software: 1) When voters enter the booth, they throw a large number of multi-sided dice. 2)
by aeternus 7y ago
Here's one way to do it that requires basically zero trust in the software:
1) When voters enter the booth, they throw a large number of multi-sided dice.
2) The resultant throw is scanned via computer-vision. Voter verifies it is correct, and it becomes the voter's ID. Voter votes normally and the vote is recorded alongside that generated "ID".
3) The voter receives a print-out that contains their (ID, vote), however it is randomly shuffled in among other real (ID, vote) pairs. The print-out is guaranteed to have at least one vote for each candidate.
4) The entire list of (ID, vote) pairs can be published nationally. Everyone can verify that the right number of votes were counted, and that their vote was accurately counted since they can find both their ID and vote in the national list.
They can show their receipt to others but cannot prove which one of the many IDs on the receipt was actually theirs.
- Nursie 7y agoOK, OK, thankyou! I can see that working, particularly part 3 there being key. Seriously I've been asking for years and this is the first time anyone's actually spelled out a scheme that allows the person to go back and prove the vote to themselves and have genuine plausible deniability to others who may seek to coerce them. Thanks :)