Cryptanalysis on Polynomial-Based E-Voting Schemes

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.