Affiliation:
1. The Bonch-Bruevich Saint-Petersburg State University of Telecommunications
Abstract
The analysis of the performance of two cryptographic algorithms (Paillier and Benaloh), in order to apply them in the construction of electronic voting systems is carried out. A description of each system and their homomorphic properties is given. Electronic voting systems based on these schemes are described. The requirements for the voting system are formulated and a comparative analysis of the voting systems based on the schemes of Paillier and Benaloh is carried out. The analysis showed that the Paillier scheme is the best and simplest method for building secure electronic voting systems, while the Benaloh scheme is more complex and computationally more time-consuming.
Publisher
Bonch-Bruevich State University of Telecommunications
Reference19 articles.
1. Korzhik V.I., Yakovlev V.A. Fundamentals of Cryptography. St. Petersburg: IC Intermedia Publ.; 2016. 296 p. (in Russ.)
2. Jabbar I., Alsaad N.S. Design and Implementation of Secure Remote e-Voting System Using Homomorphic Encryption. International Journal of Network Security. 2017;19(5):694–703. DOI:10.6633/IJNS.201709.19(5).06
3. Singh A., Ramakanth K., Cholli P., Nagaraj G. Empowering E-governance with E-voting. Indonesian Journal of Electrical Engineering and Computer Science. 2018;12:1081‒1086. DOI:10.11591/ijeecs.v12.i3.pp1081-1086
4. Benaloh J.C. Verifiable Secret-Ballot Elections. PhD Thesis. Yale University; 1996. 134 p.
5. Gennaro R., Halevi S., Rabin T. Secure Hash-and-Sign Signatures without the Random Oracle. Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques, EUROCRYPT 1999, 2–6 May 1999, Prague, Czech Republic. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer; 1999. p.123–139. DOI:10.1007/3-540-48910-X_9
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献