Fear Not, Vote Truthfully: Secure Multiparty Computation of Score Based Rules
This addresses secure voting for organizations or governments using score-based voting systems, though it appears to be an incremental improvement on existing secure computation approaches.
The authors tackled the problem of secure voting for score-based rules by proposing a protocol where independent talliers compute winners while preserving perfect secrecy of all ballot information. The result is an extremely lightweight protocol that can be deployed in real-life voting scenarios.
We propose a secure voting protocol for score-based voting rules, where independent talliers perform the tallying procedure. The protocol outputs the winning candidate(s) while preserving the privacy of the voters and the secrecy of the ballots. It offers perfect secrecy, in the sense that apart from the desired output, all other information -- the ballots, intermediate values, and the final scores received by each of the candidates -- is not disclosed to any party, including the talliers. Such perfect secrecy may increase the voters' confidence and, consequently, encourage them to vote according to their true preferences. The protocol is extremely lightweight, and therefore it can be easily deployed in real-life voting scenarios.