SUMMARY
Digital signature schemes can fulfill an actual task of ensuring fairness and transparency of electronic election. However, existing standards and protocols need modification into blind signature and additional security check by the anonymity criterion. The author examines blind signature protocol provided by Russian scientists. It is proposed to improve scheme‘s efficiency by changing inner mathematics. Elliptic curves over vector finite field enable parallel processing in group operation and reduce integer range. These advantages are illustrated by computational example. Also, improved protocol investigation by the anonymity criterion is provided in the article. The author proves that mathematics change do not affect protocol security.