Recently, remote voting systems have gained popularity and have been used for government elections and referendums in the United Kingdom, Estonia and Switzerland as well as municipal elections in Canada and party primary elections in the United States and France. Current remote voting schemes assume either the voter's personal computer is trusted or the voter is not physically coerced. In this paper, we present a remote end-to-end voting scheme, in which the voter's choice remains secret even if the voter's personal computer is infected by malware or the voter is physically controlled by the adversary. In particular, our scheme can achieve absolute verifiability even if all election authorities are corrupt. Based on homomorphic encryption, the overhead for tallying in our scheme is linear in the number of candidates. Thus, our scheme is practical for elections at a large scale, such as general elections. © 2011 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Yi, X., & Okamoto, E. (2011). Practical remote end-to-end voting scheme. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6866 LNCS, pp. 386–400). https://doi.org/10.1007/978-3-642-22961-9_30
Mendeley helps you to discover research relevant for your work.