A secure and practical electronic voting scheme

Authors:
Wei-Chi Ku;Sheng-De Wang
Affiliations:
Department of Electrical Engineering, National Taiwan University, Taipei, Taiwan;Department of Electrical Engineering, National Taiwan University, Taipei, Taiwan
Venue:
Computer Communications
Year:
1999

Citing 18
Cited 1

Distributing the power of a government to enhance the privacy of voters

PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Elections with unconditionally-secret ballots and disruption equivalent to breaking RSA

Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
A new multiple key cipher and an improved voting scheme

EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Secret ballot elections in computer networks

Computers and Security
Receipt-free secret-ballot elections (extended abstract)

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Untraceable electronic mail, return addresses, and digital pseudonyms

Communications of the ACM
A method for obtaining digital signatures and public-key cryptosystems

Communications of the ACM
A Cryptographic Scheme for Computerized Elections

CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Secure Voting Using Partially Compatible Homomorphisms

CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
A Practical Secret Voting Scheme for Large Scale Elections

ASIACRYPT '92 Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
How to Prevent Buying of Votes in Computer Elections

ASIACRYPT '94 Proceedings of the 4th International Conference on the Theory and Applications of Cryptology: Advances in Cryptology
Cryptographic protocols

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Protocols for secure computations

SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
A robust and verifiable cryptographically secure election scheme

SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Secure bit commitment function against divertibility

EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
Receipt-free mix-type voting scheme: a practical solution to the implementation of a voting booth

EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
New directions in cryptography

IEEE Transactions on Information Theory
An improved algorithm for computing logarithms over and its cryptographic significance (Corresp.)

IEEE Transactions on Information Theory

An efficient multi-receipt mechanism for uncoercible anonymous electronic voting

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.24

Visualization

Abstract

Electronic voting schemes can be divided into homomorphism encryption and anonymous channel based schemes. The former type requires massive communications and computation, thereby, inappropriate for large-scale voting. However, the soundness of the latter type heavily relies on the cooperation of the voters. Under these schemes, voting is disrupted if some voter abstains in the intermediate stages. In this article, we present a secure electronic voting scheme of the latter type. The proposed scheme is practical in that its assumptions are quite appropriate for realistic environments. More specifically, the soundness of the proposed scheme does not rely on the cooperation of the voters.