Receipt-Free Secret-Ballot Elections
- Dwight Tuinstra ,
- Josh Benaloh
STOC '94 Proceedings of the Twenty-sixth Annual ACM Symposium on Theory of Computing |
Published by Association for Computing Machinery, Inc.
Prior verifiable secret-ballot election protocols all suffer from a common defect which renders them unsuitable for practical use: they allow voters to (if they wish) carry away from the protocol receipts which can be used to prove to others how they voted. This simple defect enables vote buying and coercion which are impractical in current physical election systems due to the «plausible deniability» offered by a voting booth. This defect is embedded, not only within prior election protocols, but within all of the more general protocols for collective computation of a public function from private inputs. This paper presents the first verifiable secret-ballot election protocols in which participants are unable to prove to others how they voted.
Copyright © 1994 by the Association for Computing Machinery, Inc. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept, ACM Inc., fax +1 (212) 869-0481, or [email protected]. The definitive version of this paper can be found at ACM's Digital Library -http://www.acm.org/dl/.