1-out-of-L E-voting System with Efficient Computational Complexity Based on r-th Residue Encryption

概要

論文の詳細を見る
In this paper, we propose an e-voting system with a ballot-cancellation property. The existed voting systems had overlooked about the ballot-cancellation scheme. There is the reason that the ballot is cancelled according to an election law. For example, when a right of casting the ballot is Election Day, the ballot-cancellation scheme is needed for an absentee voter. Usually, the absentee voter casts a ballot before Election Day. If the absentee voters which cast a ballot die or lost the right of casting the ballot before Election day, the ballots of absentee voters should be cancelled according to the election law. When the ballot is cancelled, the ballot-cancellation scheme should satisfy privacy and verifiability. Cramer et al. proposed a very efficient multi-authority election schemes which guarantee privacy, robustness, and universal verifiability at Eurocrypt'97. Yamaguchi et al. pointed out that the e-voting system based on multi-party has much computing resources, and proposed the two-centered e-voting protocol based on r-th residue encryption and RSA cryptosystem. However, their system is just yes-no voting. First, we propose a 1-out-of-L e-voting based on Yamaguchi et al.'s scheme. Second, we extend this 1-out-of-L e-voting to the ballot-cancellation scheme.
社団法人電子情報通信学会の論文
2005-07-15