Can End-to-End Verifiable E-Voting be Explained Easily?

P. Kalchgruber, E. Weippl:
"Can End-to-End Verifiable E-Voting be Explained Easily?";
in:"Proceedings of the 11th International Conference on Information Integration and Web Based Applications and Services (iiWAS2009), Workshop on Emerging Research Projects, Applications and Services (ERPAS2009)", herausgegeben von: IIWAS; ACM Press, 2009, ISBN: 978-1-60558-660-1.

[ Publication Database ]


E-Voting is a widely discussed topic|both in the public and
in research. In the last couple of years new voting protocols
have been proposed. The contribution of this paper is to
explain the fundamental concepts of Ben Adida's Scratch
&Vote, show an implementation we made and report on
the \user"(i.e. voter) experience of a handful of technically
knowledgeable voters. All voters were students and they
were given an introduction to the concept and could vote
which co ee the institute should buy. We explored whether
they would be convinced that end-to-end auditable protocols
were an improvement to \normal"voting machine typically
used in the US.