DocumentCode :
2396319
Title :
Cryptanalysis on Polynomial-Based E-Voting Schemes
Author :
Tao, Wan ; Liao Weichuan
Author_Institution :
Sch. of Inf. Eng., East China Jiaotong Univ., Nanchang, China
fYear :
2010
fDate :
7-9 May 2010
Firstpage :
436
Lastpage :
438
Abstract :
Recently, CAO et al. proposed an efficient electronic voting scheme based on the polynomial function. They claimed to satisfy the fairness, uniqueness, eligibility, anonymous, accuracy and robustness. In this paper, we show that the electronic voting can guarantee neither robustness nor anonymity. Some candidate can add the ballot number by altering data, and any candidate can know the accurate content of each vote after the tallying stage.
Keywords :
cryptography; polynomials; cryptanalysis; electronic voting scheme; polynomial function; polynomial-based e-voting scheme; Computers; Electronic voting; Nominations and elections; Polynomials; Public key; Robustness; anonymity; electronic voting; polynomial function;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
E-Business and E-Government (ICEE), 2010 International Conference on
Conference_Location :
Guangzhou
Print_ISBN :
978-0-7695-3997-3
Type :
conf
DOI :
10.1109/ICEE.2010.118
Filename :
5590631
Link To Document :
بازگشت