A secure and optimally efficient multi‐authority election scheme

Abstract

In this paper we present a new multi‐authority secret‐ballot election scheme that guarantees privacy, universal veriability, and robustness. It is the first scheme for which the performance is optimal in the sense that time and communication complexity is minimal both for the individual voters and the authorities. An interesting property of the scheme is that the t and communication complexity for the voter is independent of the number of authorities. A voter simply posts a single encrypted message accompanied by a compact proof that it contains a valid vote. Our result is complementary to the result by Cramer, Franklin, Schoenmakers, and Yung in the sense that in their scheme the work for voters is linear in the number of authorities but can be instantiated to yield information‐theoretic privacy, while in our scheme the voter's effort is independent of the number of authorities but always provides computational privacy‐protection. We will also point out that the majority proposed voting schemes provide computational privacy only (often without even considering the lack of information‐theoretic privacy), and that our new scheme is by far superior to those schemes.