Information-Theoretic Secure and Private Voting System

TL;DR

This paper introduces an information-theoretic private voting system that ensures voter privacy and robustness against malicious voters using Shamir secret sharing, suitable for secure and private elections.

Contribution

It proposes a novel private voting protocol based on Shamir secret sharing that guarantees security and robustness against malicious voters, a significant improvement over existing methods.

Findings

Secure against up to (N-1)/3 malicious voters

Ensures voter privacy throughout the voting process

Robustness and security based on information-theoretic principles

Abstract

In this paper, we present a private voting system that consists of N authorized voters who may vote to one of the K candidates or vote abstain. Each voter wants to compute the final tally while staying private and robust against malicious voters, who try to gain information about the vote of the other voters beyond the final result, or send incorrect information to affect the final tally. We design an information-theoretic private voting system based on Shamir secret sharing, which is secure and robust as long as there are up to (N-1)/3 malicious voters.