A secure anonymous internet electronic voting scheme based on the polynomial

Abstract

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.

DOI: 10.1007/BF02831873

Cite this paper

@article{Feng2008ASA, title={A secure anonymous internet electronic voting scheme based on the polynomial}, author={Cao Feng and Cao Zhenfu}, journal={Wuhan University Journal of Natural Sciences}, year={2008}, volume={11}, pages={1777-1780} }