.png){kind=icon}
Return
An efficient shuffling based eVoting scheme
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jss.2011.01.001.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Among the two popular solutions to electronic voting, homomorphic tallying and shuffling, the latter employs a simpler vote format, is more efficient (especially for the voters) and practical. However, the existing shuffling-based eVoting schemes still have two drawbacks: low efficiency in large-scale applications (especially for the talliers) and weak robustness. In this paper, a novel shuffling protocol is proposed and a new eVoting scheme is designed based on it. The shuffling protocol modifies the shuffling scheme in Crypto 2005, optimising its encryption algorithm and parameter setting, improving its efficiency and overcoming its drawbacks. Thus an efficient shuffling protocol suitable for eVoting is obtained. In the second half of the paper, a delicate application of the shuffling protocol to eVoting is designed such that robustness is strengthened and efficiency is improved. (C) 2011 Elsevier Inc. All rights reserved.
Keywords:
Shuffling
E-Voting
Efficiency
Robustness
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.1
Papers:
5.4K
Citations:
8.4K
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSave
ShareSave
View more