一种可验证的多候选人电子投票方案

电子投票相对传统投票具有安全、便捷、低成本的优势,近年来得到了广泛的关注。2012年孙培勇等人提出了基于多方求和的多候选人电子投票方案。经分析发现该方案不满足可验证性,给出了一种具有可验证性的多候选人电子投票方案,保证计票结果的不可欺骗性。...

Full description

Saved in:
Bibliographic Details
Published in计算机工程与科学 Vol. 37; no. 9; pp. 1667 - 1670
Main Author 刘高 刘忆宁 王东
Format Journal Article
LanguageChinese
Published 桂林电子科技大学数学与计算科学学院,广西桂林,541004%桂林电子科技大学广西可信软件重点实验室,广西桂林,541004 2015
Subjects
不可欺骗性
可验证性
安全多方求和
电子投票
随机数
secure sum
e-voting
verifiability
电子投票
安全多方求和
不可欺骗性
随机数
non-deception
random number
可验证性
Online AccessGet full text
ISSN1007-130X
DOI10.3969/j.issn.1007-130X.2015.09.011

Cover

More Information
Summary:电子投票相对传统投票具有安全、便捷、低成本的优势,近年来得到了广泛的关注。2012年孙培勇等人提出了基于多方求和的多候选人电子投票方案。经分析发现该方案不满足可验证性,给出了一种具有可验证性的多候选人电子投票方案,保证计票结果的不可欺骗性。
Bibliography:LIU Gao ,LIU Yi-ning ,WANG Dong （1. School of Mathematics and Computational Science,Guilin University of Electronic Technology,Guilin 5410043 ; 2. Guangxi Key Lab of Trusted Software, Guilin University of Electronic Technology,Guilin 541004, China）
Compared with traditional voting schemes, e-voting has been widely studied due to the ad- vantages in contrast, including more security, more efficiency and lower cost. In 2012, Sun et al. pro- posed a multi-candidates e-voting scheme based on the secure sum, however, it did not really achieve the verifiability. In this paper, we present an improved version to satisfy the non-deception requirement and guarantee the correctness of the tally results.
43-1258/TP
e-voting ; secure sum ; random number; verifiability ; non-deception
ISSN:1007-130X
DOI:10.3969/j.issn.1007-130X.2015.09.011