3 ms·
There is a more simple way to do basically the same thing: See: https://news.ycombinator.com/item?id=19137493 https://news.ycombinator.com/item?id=19137493
by jakobov 7y ago
There is a more simple way to do basically the same thing:
See: https://news.ycombinator.com/item?id=19137493 https://news.ycombinator.com/item?id=19137493
- nickodell 7y agoI don't think your solution works. Suppose N=20. Imagine the server and 19 of the voters are compromised, and are trying to de-anonymize your vote. It "randomly" creates a group composed of you and 19 voters that are collaborating with the server to de-anonymize your vote. Assuming that the server has M collaborators, it can discover the votes of M / (N - 1) of the citizens.