A Homomorphic Tallying Based on Anonymous Channel for Electronic Voting
Electronic voting is a kind of voting different from paper voting. It is more convenient than the latter because participants dont have to come to the polling place. In addition, it is much more efficient at tallying votes. In this paper we propose an evoting protocol based on FOO-scheme. Compared with FOO-scheme, our proposal can protect voters privacy much better by employing a homomorphic tallying that makes use of the Paillier cryptosystem and noninteractive zero-knowledge arguments. When opening the votes, this scheme gives a threshold opening to open the final result.
Electronic voting anonymous channel homomorphic tallying non-interactive zero-knowledge arguments abstaining voters threshold Paillier cryptosystem
Hao Yuan Yuan Zhou Haifeng Qian
Dept.of Computer Science East China Normal University Shanghai,China National Computer Network Emergency Response Team/Coordination Center of China Beijing,China
国际会议
太原
英文
577-581
2011-02-26(万方平台首次上网日期,不代表论文的发表时间)