A Practical Receipt-Free and Uncoercible e-Voting Scheme

碩士 === 輔仁大學 === 資訊工程學系 === 91 === Bribe and coercion are common in traditional voting systems and usually lead to a biased result that imparts the desired democracy. However, these problems become more difficult to solve when using e-voting schemes. In general, e-voting schemes can be div...

Full description

Bibliographic Details
Main Authors: Ho Chun-Ming, 何俊明
Other Authors: Ku Wei-Chi
Format: Others
Language:en_US
Published: 2003
Online Access:http://ndltd.ncl.edu.tw/handle/41611391341907529017
Description
Summary:碩士 === 輔仁大學 === 資訊工程學系 === 91 === Bribe and coercion are common in traditional voting systems and usually lead to a biased result that imparts the desired democracy. However, these problems become more difficult to solve when using e-voting schemes. In general, e-voting schemes can be divided into two types, one is based on the anonymous channel and the other uses the homomorphic encryption technique. The anonymous channel technique conceals the identity of the voters, while the homomorphism encryption technique conceals the content of votes. Unfortunately, existing e-voting schemes can not effectively provide receipt-freeness and uncoercibility. This thesis first presents a two-way secure e-voting scheme that can be realized with current techniques. By applying simple physical voting booths, bribers and coercers can not monitor the voter while he votes. Additionally, by using smart cards to randomize part of content of the vote, the voter can not construct a receipt. Then, we propose a multi-way e-voting scheme based on the basic two-way e-voting scheme. We show that the performance of the proposed e-voting schemes is optimal in that time and communication complexity for the voter is independent of the number of voting authorities. Particularly, the proposed e-voting schemes are realistic because the assumptions made in them are reasonable.