Above, we described a voting protocol. Most of the approaches and techniques described are by no means new – for example, Shanks’ algorithm was introduced in 1972 and the ElGamal scheme in 1985.
So what is so special about the system? It is probably worth mentioning that we used the Ethereum blockchain, an implementation that is often called blockchain 2.0. It is notable for implementing smart contracts, which are essentially scripts, code whose execution is decentralized – in the sense that the correctness of its execution is verified by the network’s participants. In our case, it will be verified by the so-called trusted representatives (observers, candidates’ representatives, etc.).
It is in smart contracts that the voting protocol described above will be implemented. Ballot verification, vote counting etc. will be performed in a decentralized and trusted manner. There will be no black box where ballots are sent to produce a result of the vote arrived at using methods that are not transparent to observers. In fact, observers will, essentially, be an integral part of the system. In other words, the mathematical algorithms that enable us to achieve anonymity, hide intermediate results, perform calculations on encrypted data, as well as implementing these algorithms in the smart contract environment, is that synergy which we believe will provide the much-needed breakthrough in online voting systems.