位置:成果数据库 > 期刊 > 期刊详情页
A Secure Anonymous Internet Electronic Voting Scheme Based on the Polynomial
  • 时间:0
  • 分类:TP309[自动化与计算机技术—计算机系统结构;自动化与计算机技术—计算机科学与技术]
  • 作者机构:[1]School of Electronic Information and Electrical Engineering, Shanghai Jiao Tong University, Shanghai 200240, China
  • 相关基金:Supported by the National Natural Science Foundation of China (60572155) and the National Nature Science Foundation of China for Distinguished Young Scholars (60225007)
中文摘要:

在这篇论文,我们使用多项式函数和 Chaum “ s RSA (Rivest, Shamir, Adleman ) 构造一张安全匿名的因特网的盲目签名计划电子投票计划。在我们的计划,每张投票不需要在吻合的阶段被表明。候选人得到的各个的抽签数字被计算二个多项式的度数“最大的普通除数。我们的计划不要求一条特殊投票隧道和通讯能完全在当前的因特网上发生。

英文摘要:

In this paper, we use the polynomial function and Chaum's RSA (Rivest, Shamir, Adleman) blind signature scheme to construct a secure anonymous internet electronic voting scheme. In our scheme, each vote does not need to be revealed in the tallying phase. The ballot number of each candidate gets is counted by computing the degrees of two polynomials' greatest common divisor. Our scheme does not require a special voting channel and communication can occur entirely over the current internet.

同期刊论文项目
期刊论文 43 会议论文 13 著作 1
期刊论文 108 会议论文 31 著作 6
同项目期刊论文