Fully auditable electronic secret-ballot elections
Lam Berry Schoenmakers
Abstract
Lam Berry Schoenmakers
Abstract
"What could be easier than counting a bunch of votes!" is a natural thought when one first thinks of the problem of electronic voting. It does not seem very hard either to build an Internet-based system which enables people to vote conveniently from their PCs, WAP phones, or other personal devices. The problem gets much more difficult, however, if one wants to address ballot secrecy in a serious way. The challenge then is to guarantee voters’ privacy and integrity of the election result at the same time. In this paper we show how special-purpose cryptographic protocols help to achieve this goal.
OpenAlex reports 20 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
"What could be easier than counting a bunch of votes!" is a natural thought when one first thinks of the problem of electronic voting. It does not seem very hard either to build an Internet-based system which enables people to vote conveniently from their PCs, WAP phones, or other personal devices. The problem gets much more difficult, however, if one wants to address ballot secrecy in a serious way. The challenge then is to guarantee voters’ privacy and integrity of the election result at the same time. In this paper we show how special-purpose cryptographic protocols help to achieve this goal.
Key concepts: Ballot, Electronic voting, Secrecy, Computer security, Internet privacy, Computer science, Cryptography, Voting