.png){kind=icon}
返回
Practical Internet voting system
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jnca.2012.05.005.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Recently, Internet voting systems have gained popularity and have been used for government elections and referendums in the United Kingdom, Estonia and Switzerland as well as municipal elections in Canada and party primary elections in the United States and France. Current Internet voting systems assume either the voter's personal computer is trusted or the voter is not physically coerced. In this paper, we present an Internet voting system, in which the voter's choice remains secret even if the voter's personal computer is infected by malware or the voter is physically controlled by the adversary. In order to analyze security of our system, we give a formal definition of coercion-resistance, and provide security proof that our system is coercion-resistant. In particular, our system can achieve absolute verifiability even if all election authorities are corrupt. Based on homomorphic encryption, the overhead for tallying in our system is linear in the number of voters. Thus, our system is practical for elections at a large scale, such as general elections. (C) 2012 Elsevier Ltd. All rights reserved.
Keyword:
Internet voting
Coercion-resistance
Malware
Homomorphic encryption
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8
论文数:
3.6K
被引数:
1.1W
机构
引用论文
.png){kind=icon}
分享收藏
Remembering to execute deferred tasks in simulated air traffic control: The impact of interruptions.
OAAI
OAAI分享收藏分享收藏
查看更多内容