Abstract
We shall deal with cryptosystems based on public-key cryptography and their applications to secret ballot elections. Six secret balloting schemes are discussed. These are compared with respect to criteria related to the possibility of voters to check that their votes have been correctly assigned, to the vulnerability of the protocols to electoral fraud of various sorts, and to the vulnerability of protocols to vote selling.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. Benaloh, Verifiable secret-ballot elections, Technical Report 561, Computer Science Department, Yale University, 1987.
J. Benaloh and D. Tuinstra, Receipt-free secret-ballot elections, in: Proceedings STOC-94, 1994, pp. 544–553.
D. Chaum, Untraceable electronic mail, return addresses, and digital pseudonyms, Communications of the ACM 24(1981)84–88.
D. Chaum, Elections with unconditionally-secret ballots and disruption equivalent to breaking RSA, in: Advances in Cryptology – EUROCRYPT '88, ed. C. Gunther, Lecture Notes in Computer Science, vol. 330, Springer, Berlin, 1988, pp. 177–182.
J.D. Cohen and M.J. Fischer, A robust and verifiable cryptographically secure election scheme, extended abstract, Technical Report YALEU/DCS/TR-454, Yale University, 1985.
W. Diffie and M. Hellman, New directions in cryptography, IEEE Transactions on Information Theory IT-22(1976)644–654.
K.R. Iversen, A cryptographic scheme for computerized general elections, in: Advances in Cryptology – Crypto '91, Lecture Notes in Computer Science, vol. 718, Springer, Berlin, 1992, pp. 405–419.
H. Moulin, The Strategy of Social Choice, North-Holland, 1983
V. Niemi and A. Renvall, Efficient voting with no selling of votes, manuscript, 1996.
H. Nurmi and A. Salomaa, A cryptographic approach to the secret ballot, Behavioral Science 36 (1991)34–40.
H. Nurmi and A. Salomaa, Secret ballot elections and public-key cryptosystems, European Journal of Political Economy 8(1992)295–303.
H. Nurmi and A. Salomaa, Cancellation and reassignment of votes in secret ballot elections, European Journal of Political Economy 9(1993)427–435.
H. Nurmi, A. Salomaa and L. Santean, Secret ballot elections in computer networks, Computers & Security 10(1991)553–560.
B. Peleg, Game-Theoretic Analysis of Voting in Committees, Cambridge University Press, 1984.
A. Renvall, Cryptographic protocols and techniques for communication, Doctoral Dissertation, University of Turku, 1994.
R. Rivest, A. Shamir and L. Adleman, A method for obtaining digital signatures and public-key cryptosystems, ACM Communications 21(1978)120–126.
A. Salomaa, Computation and Automata, Cambridge University Press, 1985.
A. Salomaa, Public-Key Cryptography, Springer, Berlin/Heidelberg/New York, 1990.
A. Salomaa and L. Santean, Secret selling of secrets with many players, EATCS Bulletin 42(1990) 178–186.
A. Shamir, How to share a secret, Communications of the ACM 22(1979)612–613.
Rights and permissions
About this article
Cite this article
Nurmi, H., Salomaa, A. A comparative overview ofcryptographic voting protocols. Annals of Operations Research 84, 29–43 (1998). https://doi.org/10.1023/A:1018945021759
Issue Date:
DOI: https://doi.org/10.1023/A:1018945021759