A secure anonymous internet electronic voting scheme based on the polynomial

Title:

Click to see the full document

Known for:

Electronic Voting | Polynomial Function| Scheme Based

Authors:

Cao Feng Cao Zhenfu

Year:

2006

Times cited:

Expert Impact

Concepts for whichthey havehas direct influence:Electronic voting,Voting scheme,Polynomial function,Scheme based,Based polynomial.

Key People For Electronic Voting

Top KOLs in the world

David L Chaum

confirmation codes rsa signatures electronic cash

Tatsuaki Okamoto

signature schemes random oracles functional encryption

Atsushi Fujioka

authenticated key exchange naxos approach sufficient condition

Kazuo Ohta

hash functions electronic cash interactive proofs

Kazue Kazue

auction protocol voting scheme identity management

Ronald Cramer

secret sharing usepackagemathrsfs usepackageupgreek multiparty computation

Select a search phrase electronic voting , electronic voting systems , electronic voting protocols , electronic voting protocol , electronic voting machines

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.

Sign-in to see all concepts, it's free!