Exact, Efficient and Information-Theoretically Secure Voting With an Arbitrary Number of Cheaters

The authors present three voting protocols with unconditional privacy and correctness, without assuming any bound on the number of corrupt participants. All protocols have polynomial complexity and require private channels and a simultaneous broadcast channel. Unlike previously proposed protocols in this model, the protocols that they present deterministically output the exact tally. The first protocol is a basic voting scheme which allows voters to interact in order to compute the tally. Privacy of the ballot is unconditional in the sense that regardless of the behavior of the dishonest participants nothing can be learned through the protocol that could not be learned in an ideal realisation.

Provided by: University of Waterloo Topic: Security Date Added: Nov 2010 Format: PDF

Find By Topic