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 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Computational Mathematics
- Applied Mathematics
Cite this
}
Cryptanalysis on Mu-Varadharajan's e-voting schemes. / Chien, Hung Yu; Jan, Jinn Ke; Tseng, Yuh-Min.
In: Applied Mathematics and Computation, Vol. 139, No. 2-3, 15.07.2003, p. 525-530.Research output: Contribution to journal › Article
TY - JOUR
T1 - Cryptanalysis on Mu-Varadharajan's e-voting schemes
AU - Chien, Hung Yu
AU - Jan, Jinn Ke
AU - Tseng, Yuh-Min
PY - 2003/7/15
Y1 - 2003/7/15
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0037448172&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0037448172&partnerID=8YFLogxK
U2 - 10.1016/S0096-3003(02)00219-9
DO - 10.1016/S0096-3003(02)00219-9
M3 - Article
AN - SCOPUS:0037448172
VL - 139
SP - 525
EP - 530
JO - Applied Mathematics and Computation
JF - Applied Mathematics and Computation
SN - 0096-3003
IS - 2-3
ER -