Springer Verlag, Lecture Notes in Computer Science, p. 98-114
DOI: 10.1007/978-3-642-17401-8_8
Full text: Download
A number of end-to-end veriflable voting schemes have been introduced recently. These schemes aim to allow voters to verify that their votes have contributed in the way they intended to the tally and in addition allow anyone to verify that the tally has been generated correctly. These goals must be achieved while maintaining voter privacy and providing receipt-freeness. However, most of these end-to-end voting schemes are only designed to handle a single election method and the voter interface varies greatly between difierent schemes. In this paper, we introduce a scheme which handles many of the popular election methods that are currently used around the world. Our scheme not only ensures privacy, receipt-freeness and end-to-end veriflability, but also keeps the voter interface simple and consistent between various election methods.