Paper Info
Title
An implementation of a universally verifiable electronic voting scheme based on shuffling
Abstract
This paper discusses the implementation of the voting scheme based on mix-net technology. The advantages of employing this technology are that voters can vote-and-go, and that it is flexible enough to be used for variety of vote-expression methods, while ensuring the privacy of votes and the elimination of faulty players. The most attractive security feature of this scheme is its universal verifiability; anyone can confirm the correctness of the result. Such verifiability is achieved by providing proofs on correct shuffling and decryption. The paper presents a new scheme for generating a single proof for shuffle-and-decrypt process. Compared to the combination of two separate proofs on shuffle and decryption, the new scheme is 150% faster with only 80% of the length. As a result, the system was able to produce results that were verified correct within twenty minutes following a vote participated in by ten thousand voters, with three shuffling centers being used. We believe this is the first implementation report of a voting scheme with universal verifiability.
Year
DOI
Venue
2002
10.1007/3-540-36504-4_2
Financial Cryptography
Keywords
Field
DocType
voting scheme,mix-net technology,shuffling center,universal verifiability,verifiable electronic voting scheme,attractive security feature,separate proof,faulty player,new scheme,implementation report,correct shuffling,voting,election,privacy,zero knowledge proof
Electronic voting,Internet privacy,Voting,Computer science,Computer security,Correctness,Theoretical computer science,Verifiable secret sharing,Mathematical proof,Shuffling,Zero-knowledge proof
Conference
Volume
ISSN
ISBN
2357
0302-9743
3-540-00646-X
Citations 
PageRank 
References 
25
1.22
11
Authors
5
Name
Order
Citations
PageRank
Jun Furukawa135718.35
Hiroshi Miyauchi2251.22
Kengo Mori3463.45
Satoshi Obana415910.92
Kazue Sako5119780.51