By Topic

Novel Efficient Electronic Voting Mechanism Based upon Elliptic Curve

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Yu-Wei Lai ; Dept. of Comput. Sci. & Inf. Eng., Nat. Chung Cheng Univ., Chiayi, Taiwan ; Chin-Chen Chang ; Shih-Chang Chang

The essential requirements of electronic voting mechanisms include convenience, anonymity, efficiency, and robustness. In 2006, Chang and Lee proposed a t -out-of- n electronic voting method, and Chang and Cheng proposed another one based on -out-of- requirements in 2009. However, the security in their methods is based upon the asymmetric and symmetric cryptosystems like the RSA public-key cryptosystem and the DES cryptosystem. The RSA public-key cryptosystem must use a key size of 1024 bits to protect security, but this leads to higher computational cost in the voting mechanism. Therefore, we propose in this article a novel version based upon an elliptic curve cryptosystem to reduce the computational cost. Our mechanism meets the essential requirements of the electronic voting mechanism.

Published in:

Intelligent Information Hiding and Multimedia Signal Processing, 2009. IIH-MSP '09. Fifth International Conference on

Date of Conference:

12-14 Sept. 2009