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

Anne Broadbent, Stacey Jeffery, Alain Tapp

We present three voting protocols with unconditional privacy and correctness, without assuming any bound on the number of corrupt participants. All protocols have polynomial comple…