  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.
