A robust and high speed E-voting algorithm using elgammel cryptosystem

Nowadays Multi-Party computation (MPC) is a big challenge in cryptography theory that has a potential power to solve the real-life problems. But there is no much practical implementation of MPC. In this paper, we have represented a new robust algorithm for counting the respondent´s votes on an electronic poll with ensuring the confidentially of their votes. The algorithm shows the extremely good response time, so the time consuming for gathering votes of 1000 respondents is only 0.5 milliseconds. The mathematic demonstration ensures the fully privacy preserving of the algorithm. The experiments show that the algorithm is highly applicable for real world problems.