Abstract
Recently, Mu and Varadharajan proposed an efficient electronic-voting schemes. They claimed to protect voter's anonymity, to detect double voting, and to authenticate the voters. In this article, we will show the failures of the claimed functions: (1) the authority can easily identify the owner of a cast ballot; (2) a valid voter or any one can vote more than once without being detected; (3) any one can forge ballot without being authenticated. In addition to the failures of the claimed functions, we also point out other weaknesses in Mu-Varadharajan's scheme.
| Original language | English |
|---|---|
| Pages (from-to) | 525-530 |
| Number of pages | 6 |
| Journal | Applied Mathematics and Computation |
| Volume | 139 |
| Issue number | 2-3 |
| DOIs | |
| Publication status | Published - 2003 Jul 15 |
All Science Journal Classification (ASJC) codes
- Computational Mathematics
- Applied Mathematics
Fingerprint Dive into the research topics of 'Cryptanalysis on Mu-Varadharajan's e-voting schemes'. Together they form a unique fingerprint.
Cite this
Chien, H. Y., Jan, J. K., & Tseng, Y. M. (2003). Cryptanalysis on Mu-Varadharajan's e-voting schemes. Applied Mathematics and Computation, 139(2-3), 525-530. https://doi.org/10.1016/S0096-3003(02)00219-9