Abstract
We present a new, distributed e-voting protocol, which does not require any ‘conventional’ cryptography, or other means of non-trivial math, and is information-theoretically secure. In our system, the voter receives a receipt confirming her vote, and does not need to trust any pollster to correctly encrypt her vote, or convey it to the talliers. The system can withstand corruption of almost half the number of authorities running the elections. To achieve these goals, we present enhanced check vectors, a new weak signature scheme as well as a new protocol for joint creation of weak signatures by multiple servers.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. Benaloh and M. Yung. “Distributing the power of a government to enhance the privacy of voters”. In Proceedings of the 5th A CM Symposium on Principles of Distributed Computing (PODC), pp. 52–62, 1986.
California Internet Voting Task Force final report, available at http://www.ss.ca.gov/executive/ivote/
D. Chaum. “Untraceable electronic mail, return addresses and digital pseudonyms”. Communications of the ACM 24(2):84–88, 1981.
D. Chaum. “Security without identification: Transaction systems to make big brother obsolete”. Communication of the ACM 28(1):1030–1044, 1985.
R. Cramer, M. Franklin, B. Schoenmakers and M. Yung. “Multi-authority secret-ballot elections with linear work”. LNCS 1070, Advances in Cryp-tology — EUROCRYPT’ 96, pp. 72–83, 1996.
R. Cramer, R. Gennaro and B. Schoenmakers. “A secure and optimally efficient multi-authority election scheme”. LNCS 1233, Advances in Cryptology — EUROCRYPT’ 97, pp. 103–118, 1997.
L. F. Cranor and R. K. Cytron. “Sensus: A security-conscious electronic polling system for the Internet”. Proceedings of the Hawai’i International Conference on System Sciences, 1997, Wailea, Hawaii.
T. H. Cormen, C. E. Leiserson and R. L. Rivest. “Introduction to Algorithms”. MIT Press, 1989
CALTECH-MIT/Voting Technology Project http://wvw.vote.caltech.edu/Reports/index.html
R. DeMillo, N. Lynch, and M. Merritt. “Cryptographic protocols”. Proceedings of the 14th Annual Symposium on the Theory of Computing, pp. 383–400, 1982.
B. W. DuRette. “Multiple administrators for electronic voting”. B.Sc thesis, MIT, 1999. http://theory.lcs.mit.edu/~cis/theses/DuRette-bachelors.pdf
M. Franklin and M. Yung. “The blinding of weak signatures (extended abstract)”. LNCS 950, Advances in Cryptology — EUROCRYPT 94, pp. 67–76, 1995.
B. Fujioka, T. Okamoto and K. Ohta. “A practical secret voting scheme for large scale elections”. LNCS 718, Advances in Cryptology — ASIACRYPT’ 92, pp. 244–251, 1992.
Q. He and Z. Su. “A new practical secure e-voting scheme”. IFIP/SEC’ 98 14th International Information Security Conference, 1998.
Internet Policy Institute, Report of the National Workshop on Internet Voting: Issues and research agenda. Available at: http://www.netvoting.org/Resources/InternetVotingReport.pdf
D. Malkhi and E. Pavlov. “Anonymity without ‘Cryptography’”. Proceedings of Financial Cryptography’ 01 (FC’ 01).
T. Rabin and M. Ben-Or. “Verifiable secret sharing and multiparty protocols with honest majority”. In Proceedings of the 21st ACM Symposium on Theory of Computing (STOC), pp. 73–85, 1989.
A. Salomaa. “Verifying and recasting secret ballots in computer networks”. LNCS 555, New Results and New Trends in Computer Science, pp. 283–289, 1991.
B. Schoenmakers. “A Simple publicly verifiable secret sharing scheme and its application to electronic voting”. LNCS 1666, Advances in Cryptology — CRYPTO’ 99, pp. 148–164, 1999.
M. Wright, M. Adler, B. N. Levine, C. Shields. “An Analysis of the Degradation of Anonymous Protocols”. In Proceedings of Network and Distributed System Security Symposium, 2002.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 IFCA/Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Malkhi, D., Margo, O., Pavlov, E. (2003). E-voting without ‘Cryptography’. In: Blaze, M. (eds) Financial Cryptography. FC 2002. Lecture Notes in Computer Science, vol 2357. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36504-4_1
Download citation
DOI: https://doi.org/10.1007/3-540-36504-4_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00646-6
Online ISBN: 978-3-540-36504-4
eBook Packages: Springer Book Archive