Information Theoretically Private and Secure Distributed Voting Without a Trusted Authority

In this paper, we present a private voting system that consists of N 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 voting system that uses verifiable secret sharing and multi-party computation, which is secure and private as long as there are up to $\left\lfloor {\frac{{N - 1}}{3}} \right\rfloor $ malicious voters.