Information-Theoretically Secure Voting Without an Honest Majority

Understand

We present three voting protocols with unconditional privacy and information-theoretic correctness, without assuming any bound on the number of corrupt voters or voting authorities.

• All protocols have polynomial complexity and require private channels and a simultaneous broadcast channel.
• Our first protocol is a basic voting scheme which allows voters to interact in order to compute the tally.
• Privacy of the ballot is unconditional, but any voter can cause the protocol to fail, in which case information about the tally may nevertheless transpire.