Java-based Uncoercibility System in Electronic Voting

• Main Authors: Ying-Shiuan Wu, 吳盈萱
• Other Authors: 李鴻璋
• Format: Others
• Language: zh-TW
• Published: 2010
• Online Access: http://ndltd.ncl.edu.tw/handle/56372701501903301677

碩士 === 淡江大學 === 資訊管理學系碩士班 === 98 === Only when the possible coercing behaviors in the developmental electronic voting system can be solved, the system can become practical. We explore the evolution of voting system in this paper. The defect that the large resources are expending in the traditional voting system is the reason that evolves the mechanical voting system and the electronic- counted voting system. However, both systems count only at the tally stage. Farther more an electronic voting system was proposed to provide a state-of-the-art capability through the voting process. However, within this system the voters might be threatened to cast the candidate that the voters don’t want to support by the coercers. Thus, we propose a mechanism to free from the coercers in electronic voting. In the system, we use two pairs of PIN code, PW1 and PW2, to login our electronic voting system. The voter enter the PIN code, PW1, that is used in uncoerced condition to derive a couple of keys, (ei1 ,di1). If the voter has used this private key to sign his vote, the vote is the valid ballot. Whereas, the voter enter the PIN code, PW2, that is used in coerced condition to derive a couple of keys, (ei2 ,di2). And if the voter has used this private key to sign his vote, the vote is the void ballot. The same is, regardless of using which couple of keys, the voter will get the ticket according to his signed vote by the Tally Center. Thus, we can reduce the possibility of coerced, and make the electronic voting system to be more reasonable and safe.