Abstract
This paper proposes a practical secret voting scheme for large scale elections. The participants of the scheme are voters, an administrator, and a counter. The scheme ensures the privacy of the voters even if both the administrator and the counter conspire, and realizes voting fairness, i.e., no one can know even intermediate result of the voting. Furthermore fraud by either the voter or the administrator is prohibited.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
T. Asano, T. Matsumoto, and H. Imai, “A Study on Some Schemes for Fair Electronic Secret Voting” (in Japanese), The Proceedings of the 1991 Symposium on Cryptography and Information Security, SCIS91-12A (Feb., 1991).
M. Ben-Or, S. Goldwasser, and A. Wigderson, “Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation”, Proceedings of the 20th Annual ACM Symposium on Theory of Computing, pp.1–10 (May, 1988).
J. Benaloh and M. Yung, “Distributing the Power of a Government to Enhance the Privacy of Votes”, Proceedings of the 5th ACM Symposium on Principles of Distributed Computing, pp.52–62 (Aug., 1986).
D. L. Chaum, “Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms”, Communications of the ACM, Vol.24, No.2, pp.84–88 (Feb., 1981).
D. Chaum, “Security without Identification: Transaction Systems to Make Big Brother Obsolete”, Communications of the ACM, Vol.28, No.10, pp.1030–1044 (Oct., 1985).
D. Chaum, “The Dining Cryptographers Problem: Unconditional Sender and Recipient Untraceability”, Journal of Cryptology, Vol.1, No.1, pp.65–75 (1988).
D. Chaum, “Elections with Unconditionally-Secret Ballots and Disruption Equivalent to Breaking RSA”, in Advances in Cryptology — EUROCRYPT '88, Lecture Notes in Computer Science 330, Springer-Verlag, Berlin, pp.177–182 (1988).
D. Chaum, C. Crépeau, and I. Damgård, “Multiparty Unconditionally Secure Protocols”, Proceedings of the 20th Annual ACM Symposium on Theory of Computing, pp.11–19 (May, 1988).
J. Cohen and M. Fisher, “A Robust and Verifiable Cryptographically Secure Election Scheme”, 26th Annual Symposium on Foundations of Computer Science, IEEE, pp.372–382 (Oct., 1985).
D. Chaum, A. Fiat, and M. Naor, “Untraceable Electronic Cash”, in Advances in Cryptology — CRYPTO '88, Lecture Notes in Computer Science 403, Springer-Verlag, Berlin, pp.319–327 (1990).
W. Diffie and M. E. Hellman, “New Directions in Cryptography”, IEEE Transactions on Information Theory, Vol.IT-22, No.6, pp.644–654 (Nov., 1976).
O. Goldreich, S. Micali, and A. Wigderson, “How to Play Any Mental Game or a Completeness Theorem for Protocols with Honest Majority”, Proceedings of the 19th Annual ACM Symposium on Theory of Computing, pp.218–229 (May, 1987).
K. R. Iversen, “A Cryptographic Scheme for Computerized General Elections”, in Advances in Cryptology — CRYPTO '91, Lecture Notes in Computer Science 576, Springer-Verlag, Berlin, pp.405–419 (1992).
M. Naor, “Bit Commitment Using Pseudo-Randomness”, in Advances in Cryptology — CRYPTO '89, Lecture Notes in Computer Science 435, Springer-Verlag, Berlin, pp.128–136 (1990).
A. Pfitzmann, “A Switched/Broadcast ISDN to Decrease User Observability”, 1984 International Zurich Seminar on Digital Communications, IEEE, pp. 183–190 (Mar., 1984).
K. Ohta, “An Electrical Voting Scheme using a Single Administrator” (in Japanese), 1988 Spring National Convention Record, IEICE, A-294 (Mar., 1988).
K. Sako, “Electronic Voting System with Objection to the Center” (in Japanese), The Proceedings of the 1992 Symposium on Cryptography and Information Security, SCIS92-13C (Apr., 1992).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fujioka, A., Okamoto, T., Ohta, K. (1993). A practical secret voting scheme for large scale elections. In: Seberry, J., Zheng, Y. (eds) Advances in Cryptology — AUSCRYPT '92. AUSCRYPT 1992. Lecture Notes in Computer Science, vol 718. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57220-1_66
Download citation
DOI: https://doi.org/10.1007/3-540-57220-1_66
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57220-6
Online ISBN: 978-3-540-47976-5
eBook Packages: Springer Book Archive