On the security of condorcet electronic voting scheme

Authors:
Yoon Cheol Lee;Hiroshi Doi
Affiliations:
Department of Information and System Engineering, Chuo University, Tokyo, Japan;Institute of Information Security, Yokohama, Japan
Venue:
CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part II
Year:
2005

Citing 11
Cited 0

Untraceable electronic mail, return addresses, and digital pseudonyms

Communications of the ACM
An Efficient Scheme for Proving a Shuffle

CRYPTO '01 Proceedings of the 21st 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
Mix and Match: Secure Function Evaluation via Ciphertexts

ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Receipt-Free Electronic Voting Schemes for Large Scale Elections

Proceedings of the 5th International Workshop on Security Protocols
Verifiable secret-ballot elections

Verifiable secret-ballot elections
A Secure and Fully Private Borda Voting Protocol with Universal Verifiability

COMPSAC '04 Proceedings of the 28th Annual International Computer Software and Applications Conference - Volume 01
Multi-authority secret-ballot elections with linear work

EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
A secure and optimally efficient multi-authority election scheme

EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Efficient receipt-free voting based on homomorphic encryption

EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
An implementation of a universally verifiable electronic voting scheme based on shuffling

FC'02 Proceedings of the 6th international conference on Financial cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we focus on the Condorcet voting scheme in which each voter votes with the full order of the candidates according to preference, and the result of the election is determined by one-on-one comparisons between each candidate. We propose the Condorcet electronic voting scheme that is secure, universally verifiable and satisfying one-on-one comparison privacy. Furthermore the result of the election can be determined without revealing the order of the candidates which each voter specified. We use a matrix to represent the order of all the candidates according to preference, and satisfy one-on-one comparison privacy using homomorphic property.