Abstract
This paper proposes a practical large scaled secret voting scheme which satisfies the receipt-free property* as well as the fairness property†. This scheme uses three realistic tools: a non-anonymous channel, a bulletin board, and a private channel. The participants of the scheme are the voters and voting commissioners (administrators, privacy commission members, and timeliness commission members). There are four stages to this scheme: the authorizing stage, voting stage, claiming stage, and counting stage. A voter performs just one round message exchange with the administrators in the authorizing stage, and is required to send just one message in the voting stage.
Chapter PDF
Similar content being viewed by others
Keywords
References
M. Ben-Or, S. Goldwasser, and A. Wigderson, “Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation”, Proc. of STOC’88, pp. 1–10 (1988).
M. Bellare and P. Rogaway, “Optimal Asymmetric Encryption”, Proc. of Eurocrypt’ 94, LNCS 950, Springer—Verlag (1994).
J. Benaloh and D. Tuinstra, “Receipt-Free Secret-Ballot Elections”, Proc. of STOC’94, pp. 544–553 (1994).
J. Benaloh and M. Yung, “Distributing the Power of a Government to Enhance the Privacy of Votes”, Proc. of PODC’86, pp. 52–62 (1986).
D. Chaum, “Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms”, Communications of the ACM, Vol. 24, No. 2, pp. 84–88 (1981).
D. Chaum, “Security without Identification: Transaction systems to Make Big Brother Obsolete”, Communications of the ACM, Vol. 28, No. 10, pp. 1030–1044 (1985).
D. Chaum, “Elections with Unconditionally-Secret Ballots and Disruption Equivalent to Breaking RSA”, Proceedings of Eurocrypt’88, LNCS 330, Springer–Verlag, pp. 177–182 (1988).
D. Chaum, C. Crépeau, and I. Damgâ,rd, “Multiparty Unconditionally Secure Protocols”, Proc. of STOC’88, pp. 11–19 (1988).
J. Cohen and M. Fisher, “A Robust and Verifiable Cryptographically Secure Election Scheme”, Proc. of FOCS, pp. 372–382 (1985).
R. Cramer, M. Franklin, B. Schoenmakers, and M. Yung, “Multi-Authority Secret-Ballot Elections with Linear Work”, Proc. of Eurocrypt’96, LNCS 1070, Springer–Verlag, pp. 72–82 (1996).
A. Fujioka, T. Okamoto, and K. Ohta, “A Practical Secret Voting Scheme for Large Scale Elections”, Proc. of Auscrypt ‘82, LNCS, Springer–Verlag, pp. 244–251 (1992).
Goldreich, S. Micali, and A. Wigderson, “How to Play Any Mental Game, or a Completeness Theorem for Protocols with Honest Majority”, Proc. of STOC, pp.218229 (1987).
K. R. Iversen, “A Cryptographic Scheme for Computerized General Elections”, Proc. of Crypto ‘81, LNCS 576, Springer–Verlag, pp. 405–419 (1992).
M. Jakobsson, K. Sako, and R. Impagliazzo, “Designated Verifier Proofs and Their Applications”, Proc. of Eurocrypt ‘86, LNCS 1070, Springer–Verlag, pp. 143–154 (1996).
MR91] S. Micali, and P. Rogaway, “Secure Computation (Chapter 1–3)”, Manuscript (August 9, 1991). (The abstract version: Advances in Cryptology — CRYPTO ‘81, Lecture Notes in Computer Science 576, Springer–Verlag, Berlin, pp.392–404 (1992)).
K. Ohta, “An Electrical Voting Scheme using a Single Administrator”, 1988 Spring National Convention Record, IEICE, Japan, A-294 (1988).
T. Okamoto, “Provably Secure and Practical Identification Schemes and Corresponding Signature Schemes”, Proc. of Crypto’92, LNCS 740, Springer–Verlag, pp. 3153 (1993).
T. Okamoto, and K. Ohta, “Divertible Zero-Knowledge Interactive Proofs and Commutative Random Self-Reducible,” Proc. of Eurocrypt ‘89, LNCS 434, Springer-Verlag, pp. 134–149 (1990).
K. Sako, and J. Kilian, “Secure Voting Using Partially Compatible Homomorphisms”, Proc. of Crypto’94, LNCS 839, Springer–Verlag, pp. 411–424 (1994)
K. Sako, and J. Kilian, “Receipt-Free Mix-type Voting Scheme”, Proc. of Eurocrypt’95, LNCS 921, Springer–Verlag, pp. 393–403 (1995)
M. Stadler, “Cryptographic Protocols for Revocable Privacy”, PhD Thesis, ETH (1996), http://www.inf.ethz.ch/personal/stadler/thesis.ps
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Okamoto, T. (1996). An electronic voting scheme. In: Terashima, N., Altman, E. (eds) Advanced IT Tools. IFIP — The International Federation for Information Processing. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-34979-4_3
Download citation
DOI: https://doi.org/10.1007/978-0-387-34979-4_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-4416-3
Online ISBN: 978-0-387-34979-4
eBook Packages: Springer Book Archive