Abstract
This paper presents a set of network protocols which provide for a voting service. The service is currently being implemented in the client-server architecture. The cryptographic technique combined with the basic voting protocol from Salomaa [19] is the method based on the multiple key ciphers introduced by Boyd [2]. Special protocols for registration of voters and issuing voting slips are developed. This ensures that the anonymity of a voting strategy is cryptographically secure and, on the other hand, that only legitimate voters may obtain a valid voting slip.
Chapter PDF
Similar content being viewed by others
References
Benaloh, J.C., Secret Sharing Homomorphisms: Keeping Shares of a Secret Secret (Extended Abstract), Proceedings of EUROCRYPT 86, Springer Verlag, 251–260, 1986
Boyd, C.A., Some Applications of Multiple Key Ciphers, Proceedings of EUROCRYPT 88, Springer Verlag, 455–467, 1988
Boyd, C.A., A New Multiple Key Cipher and an Improved Voting Scheme, Proceedings of EUROCRYPT 89, Springer Verlag, 617–625, 1989
Brassard, G., Crepeau, C., Robert, J.-M., All-or-Nothing Disclosure of Secrets, Proceedings of CRYPTO 86, Springer Verlag, 234–238, 1987
CCITT, Recommendation X.509: The Directory: Authentication Framework
Chaum, D.L., Elections with Unconditionally-Secret Ballots and Disruption Equivalent to Breaking RSA, Proceedings of EUROCRYPT 88, Springer Verlag, 177–182, 1988
Chaum, D.L., Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms, Communications of the ACM, Vol. 24, 84–88, 1981
Chen, L., Oblivious Signatures, Proceedings of ESORICS 94, Springer Verlag, 161–172, 1994
Cohen, J., Fischer, M., A Robust and Verifiable cryptographically Secure Election Scheme, Proc. 26th IEEE Symp. on Foundations of Computer Science, 372–382, Portland (OR), 1985
Davies, D.W., Price, W.L., Security for Computer Networks. An Introduction to Data Security in Teleprocessing and Electronic Funds Transfer, John Wiley&Sons, 1989
Fujioka, A., Okamoto, T., Ohta, K., A Practical Secret Voting Scheme for Large Scale Elections, Proceedings of AUSCRYPT 92, Springer Verlag, 244–251, 1992
Information technology–Open Systems Interconnection–Basic Reference Model–Part 2: Security Architecture, ISO IS 7498–2, 1989
Lippitsch,P., Posch, K.C.,Posch R., Schindler, V. A scalable RSA design with encryption rates from 200 Kbit/s to 1.5 Mbit/s, 32nd International Science Week, Damascus, Dec. 1992
Nurmi, Il., Salomaa, A., Santean, L., Secret Ballot Elections in Computer Networks, Cornputers&Security 10, 553–560, 1991
Park, C., Itoh, K., Kurosawa, K., Efficient Anonymous Channel and All/Nothing Election Scheme, Proceedings of AUSCRYPT 91(?), Springer Verlag, 248–259, 1991
Renvall, A., ANDOS: A Simple Protocol for Secret Selling of Secrets, EATCS Bulletin ??, 200–205, 199?
Rivest, R.L., Shamir, A. and Adleman L., A Method for Obtaining Digital Signatures and Public-Key Cryptosystems, Comm. ACM 21, 120–126, 1978
Schneier, B., Applied Cryptography, John Wiley&Sons, 1994
Salomaa,.A., Verifying and Recasting Secret Ballots in Computer Networks, EATCS Bulletin 44, 1991
Salomaa, A, Santean, L., Secret Selling of Secrets with Several Buyers, EATCS Bulletin, 42, 178–186, 1990
Schneider, W., SecuDE: Overview (Version 3.0), Institut fuer TeleKooperationsTechnik, Darmstadt, March 1992
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 IFIP International Federation for Information Processing
About this chapter
Cite this chapter
Hassler, V., Posch, R. (1995). A LAN Voting Protocol. In: Eloff, J.H.P., von Solms, S.H. (eds) Information Security — the Next Decade. IFIP Advances in Information and Communication Technology. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-34873-5_15
Download citation
DOI: https://doi.org/10.1007/978-0-387-34873-5_15
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-5041-2910-7
Online ISBN: 978-0-387-34873-5
eBook Packages: Springer Book Archive