# Fear Not, Vote Truthfully: Secure Multiparty Computation of Score Based   Rules

**Authors:** Lihi Dery, Tamir Tassa, and Avishay Yanai

arXiv: 1903.06472 · 2022-01-28

## TL;DR

This paper introduces a secure, privacy-preserving voting protocol for score-based rules that ensures perfect secrecy, encouraging truthful voting and enabling easy deployment in real-world elections.

## Contribution

It presents a novel secure multiparty computation protocol for score-based voting that guarantees perfect secrecy and is lightweight for practical use.

## Key findings

- Protocol achieves perfect secrecy of ballots and scores.
- Ensures truthful voting by protecting voter privacy.
- Lightweight design suitable for real-life deployment.

## Abstract

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.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1903.06472/full.md

## Figures

2 figures with captions in the complete paper: https://tomesphere.com/paper/1903.06472/full.md

## References

50 references — full list in the complete paper: https://tomesphere.com/paper/1903.06472/full.md

---
Source: https://tomesphere.com/paper/1903.06472