Abstract

A generalized scheme of remote electronic voice based on homomorphic encryption is considered. Two methods of protecting the voting system from the threat from the voter, consisting in incorrect filling of the ballot by the voter, are investigated. Both methods are based on the algorithms of “zero-knowledge proof”. Evaluations of the complexity of calculations in the formation of proof of the correctness of filling in the ballot by the voter and Evaluations of the complexity of verification of the proof by the controlling party are obtained. A comparative analysis of the complexity of the implementation of both methods has shown that the method based on the proof based on the equality of logarithms has less complexity of calculations on the voter's side compared to the method based on the mixing of votes. At the same time, the second method (the method of mixing votes) requires 1.67 times less calculations in the blockchain, which becomes a significant factor in choosing the second method in favor of a large number of voters.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call