.png){kind=icon}
返回
An efficient shuffling based eVoting scheme
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jss.2011.01.001.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Shuffling
E-Voting
Efficiency
Robustness
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.1
论文数:
5.4K
被引数:
8.4K
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏分享收藏分享收藏
查看更多内容