Abstract
Three protocols related to computer voting are presented. First protocol is an efficient ANDOS protocol which is based on a natural cryptographic assumption. The other two protocols attack a difficult problem in computer voting: buying of votes. We manage to solve this problem but our protocols are impractical in large-scale elections.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J. Benaloh: Verifiable secret-ballot elections, Ph.D. thesis, Yale university, Technical report 561, (1987).
G. Brassard, C. Crepeau: Zero-knowledge simulation of boolean circuits, Proc. CRYPTO '86, Springer LNCS 263 (1987), pp. 223–233.
G. Brassard, C. Crepeau, J.-M. Robert: All-or-nothing disclosure of secrets, Proc. CRYPTO '86, Springer LNCS 263 (1987), pp. 234–238.
D. Chaum: Untraceable electronic mail, return address, and digital pseudonyms, Comm. of ACM, 24 (1981), pp. 84–88.
D. Chaum: Zero-knowledge undeniable signatures, Proc. EUROCRYPT '90, Springer LNCS 473, (1991), pp. 458–464.
D. Chaum, I. Damgård, J. van de Graaf: Multiparty computations ensuring privacy of each party's input and correctness of the result, Proc. CRYPTO '87, Springer LNCS 255 (1988), pp. 87–119.
C. Crepeau: A zero-knowledge poker protocol that achieves confidentiality of the players' strategy or how to achieve an electronic poker face, Proc. CRYPTO '86, Springer LNCS 263 (1987), pp. 239–250.
K. Iversen: A cryptographic scheme for computerized general elections, Proc. CRYPTO '91, Springer LNCS 576 (1992), pp. 405–419.
H. Nurmi, A. Salomaa, L. Santean: Secret ballot elections in computer networks, Computers and Security 10 (1991), pp. 553–560.
C. Park, K. Itoh, K. Kurosawa: All/nothing election scheme and anonymous channel, to appear in Proc. EUROCRYPT '93.
R. Rivest: Cryptography, in J. van Leeuwen (ed.): Handbook of Theoretical Computer Science: Algorithms and complexity, Elsevier (1990), pp. 719–755.
A. Salomaa, L. Santean: Secret selling of secrets with several buyers, Bulletin of EATCS 42 (1990), pp. 178–186.
G. Simmons: An introduction to shared secret and/or shared control schemes and their application, in G. Simmons (ed.): Contemporary cryptology: the science of information integrity, IEEE Press (1992), pp. 441–497.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Niemi, V., Renvall, A. (1994). Cryptographic protocols and voting. In: Karhumäki, J., Maurer, H., Rozenberg, G. (eds) Results and Trends in Theoretical Computer Science. Lecture Notes in Computer Science, vol 812. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58131-6_55
Download citation
DOI: https://doi.org/10.1007/3-540-58131-6_55
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58131-4
Online ISBN: 978-3-540-48445-5
eBook Packages: Springer Book Archive