Bare-handed electronic voting with pre-processing
Ben Riva, Amnon Ta‐Shma · 2007
Many electronic voting systems assume the user votes with some computing device. This raises the question whether a voter can trust the device he is using. Two years ago, Chaum, and independently Neff, proposed what we call bare-handed electronic voting, where voters do not need any computational power. Their scheme has a very strong unforgeability guarantee. The price for that, however, is that they require the voter to tell his vote to the voting booth. It seems that every scheme that does not require any computational power from the voter has this drawback. We modify this model. We allow the voter the use of a computer device but only at a pre-processing stage- the voting itself is done bare-handed. We propose an extension to known voting schemes, and we show that such extended schemes enjoy the same unforgeability guarantee as that of Chaum and Neff. In addition, our extended scheme is private, and the voter does not reveal his vote to the voting booth. Our solution works for elections with a bounded number of candidates.