Abstract
This paper describes a new receipt-free electronic voting system for an open network. In our system, the voters vote with anonymous voting passes, which is motivated by the E-Cash protocol [l]. We have modified the E-Cash protocol such that the pass is non-transferable. A modified commitment scheme is also employed so that the administrator cannot change the vote even if it knows the content of the ballot. Our system is designed for realising the digitalization of large-scale elections conducted by the government. Various aspects involved in an election are considered during protocol design so that the potential cheats of either the voters or the administrators are prevented.
The original version of this chapter was revised: The copyright line was incorrect. This has been corrected. The Erratum to this chapter is available at DOI: 10.1007/978-0-387-35515-3_53
Chapter PDF
Similar content being viewed by others
References
David Chaum, Amos Fiat and Moni Naor, “Untraceable Electronic Cash,” Advances in Cryptology — Proceedings of CRYPTO’88, 1988.
David Chaum, “Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms,” Communications of the ACM 24, 2, 1981.
Atsushi Fujioka, Tatsuaki Okamoto, Kazuo Ohta. “A Practical Secret Voting Scheme for Large Scale Election,” Advances in Cryptology — Proceedings of AUSCRYPT’92, 1992.
J. Benaloh and D. Tuinstra, “Receipt-Free Secret-Ballot Elections (Extended Abstract),” Proceedings of the 26th Annual ACM Symposium on the Theory of Computing, 1994.
Tatsuaki Okamoto, “Receipt-Free Electronic Voting Schemes for Large Scale Elections,” Proceedings of Security Protocols’97, 1997.
Michael J. Radwin, “An Untraceable, Universally Verifiable Voting Scheme,” Seminar in Cryptology, 1995.
Yi Mu and Vijay Varadharajan, “Anonymous Secure E-Voting over a Network,” Proceedings of 14th Annual Computer Security Applications Conference, 1998.
Qi He and Zhongmin Su, “A New Practical Secure e-Voting Scheme,” Proceedings of SEC’98, 1998.
A. Riera, J. Borrell and J. Rifa, “An Uncoercible Verifiable Electronic Voting Protocol,” Proceedings of SEC’98, 1998.
Rivest, R.L., A. Shamir, and L. Adleman, “A Method for Obtaining Digital Signatures and Public-Key Cryptosystems,” Communications of the ACM, v. 21, n. 2, 1978.
K. S. McCurley, “The Discrete Logarithm Problem”, Cryptology and Computational Number Theory, v.42 of Proceedings of Symposia in Applied Mathematics, 1990.
Josh Cohen Benaloh, “Secret Sharing Homomorphisms: Keeping Shares of a Secret Secret (Extended Abstract),” Proceedings of CRYPTO’86.
Ronald Cramer, Matthew Franklin, Berry Schoenmakers and Moti Yung, “Multi-Authority Secret-Ballot Elections with Linear Work,” Proceedings of EUROCRYPT’96, 1996.
B. DuRette, “Multiple Administrators for Electronic Voting, ” MIT Thesis, 1999.
J. Cohen et al., “A Robust and Verifiable Cryptographically Secure Election Scheme,” Proceedings of the 26th IEEE Symposium on Foundations of Computer Science, 1985.
Josh Benaloh and Moti Yung, “Distributing the Power of a Government to Enhance the Privacy of Voters,” Proceedings of 5th ACM Symposium on Principles of Distributed Computing, 1986.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 IFIP International Federation for Information Processing
About this paper
Cite this paper
Chan, R.Y., Wong, J.C., Chan, A.C. (2000). Anonymous Electronic Voting System with Non-Transferable Voting Passes. In: Qing, S., Eloff, J.H.P. (eds) Information Security for Global Information Infrastructures. SEC 2000. IFIP — The International Federation for Information Processing, vol 47. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35515-3_33
Download citation
DOI: https://doi.org/10.1007/978-0-387-35515-3_33
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-5479-7
Online ISBN: 978-0-387-35515-3
eBook Packages: Springer Book Archive