A Secure Anonymous Internet Electronic Voting Scheme Based on the Polynomial  

作　　者：CAO Feng CAO Zhenfu 

机构地区：[1]School of Electronic Information and Electrical Engineering, Shanghai Jiao Tong University, Shanghai 200240, China

出　　处：《Wuhan University Journal of Natural Sciences》2006年第6期1777-1780,共4页武汉大学学报（自然科学英文版）

基　　金：Supported by the National Natural Science Foun-dation of China (60572155) ;the National Nature Science Founda-tion of China for Distinguished Young Scholars (60225007)

摘　　要：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.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.

关 键 词：electronic voting blind signature RSA（Rivest  Sharrtir  Adleman） polynomial function 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]