Thanks.
As fall of democracies goes, it seems that auditability is a better properties to have than anonymity (because when the totalitariam regime is sufficiently powerful to openly threat people, anonymity most certainly doesn’t matter anymore. But on a working democracy, people need to be sure of the transparency of the system to believe and accept it).
Is there a place where all these methods are formally defined in a comparable way?
I’m a little lost with all the acronym, and having all of them in a big table with their algorithm & properties would be extremelly useful.
Hello,
Thank you for that very insightful article.
Sorry to post a question so long after its publication, I hope it will reach you. I’m wondering how all these methods stands for anonimity of voters, I’m explaining: in most election, there is a lot of candidats (at leat, it’s the case in France, where for example the last 1st round of Presidential election had 11 voters. That leads to a lot of unique permutation (for example, with Approval, we can encode 2^11 = 2048 states, for a fully sorted algo we get 11!, etc). In France, votes are organized in small polling station of generally less than 2000 people.
So it seems that a bad actor would be able to threat people to vote for someone, forcing them to vote for a special encoding, and that just by comparing the number of total vote for that encoding, the bad actor would get a good guess about the actual vote of the threaten people.
Is there any electoral algorithms robust againts that threat vector?
Thanks,