Computer Science Department
School of Computer Science, Carnegie Mellon University
Stochastic Voting Protocol
Hiroaki Kikuchi*, Jin Akiyama**, Howard Gobioff, Gisaku Nakamura**
Keywords: Electronic voting, randomized algorithm, security
protocol, confidence interval, commitment protocol
This paper proposes a voting scheme that protects voters privacy
even when the Central Tabulating Facility reveals individual responses.
The basic idea is to add random noise to the true opinion by randomizing
in a way such that the true vote is chosen with higher probability than
the other alternatives. A major part of this paper is to outline the
statistical properties of our proposed protocol. A commitment protocol
is also proposed to cope with dishonest voters who do not randomize
their votes. The primary result is that the accuracy of the voting
result improves as the number of voters increases.
*Tokai University and Carnegie Mellon University