The multi-candidates electronic election is very useful in numerous practical situations. Most of the electronic election schemes discuss Boolean election in which voters can only cast "yeso" vote. A new multi-candidates electronic election scheme is presented which is appropriate for "k-out-of-n" election. The scheme is characterized with perfect security, anonymity, fairness, correctness and verification. A vote can cast more than one candidate in one vote. The big prime numbers that are the markers of the candidates supported by a voter are multiplied as a vote. The validity of a vote can be concluded based on whether a vote is exactly divisible by the square of every candidate's marker or not. Electoral office checks a voter's identification and qualifies the voter for vote by his blind signature. But the identification of a voter can not be revealed by the electoral office, the teller or their conspiracy because they don't know all the keys used to encrypt the voter's identification. All the votes will be released by the teller and anyone can verify the final ballot.
展开▼
