A model of a secure electronic voting system based on blind intermediaries using russian cryptographic algorithms
Liudmila K. Babenko, Ilya Pisarev, Oleg Makarevich · 2017
Information technology is being increasingly introduced into our lives. Most areas of human activity are widely associated with information technology, and electronic voting is no exception. At the moment, there are a number of ready-made solutions, but all of them are not sufficiently safe and open, and most importantly most of them are produced outside the Russian Federation. In such strategically important areas as e-government, in particular electronic elections, it is necessary to be completely confident in the algorithms, principles and systems used. The issue is raised about creating a secure and trustworthy system, and most importantly, an open one and implemented using standardized cryptographic algorithms of the Russian Federation. A model of the system is proposed based on the principle of blind intermediaries developed by the authors and using cryptographic algorithms such as the symmetric cipher GOST R 34.12-2015 (Kuznyechik), hash function GOST R 34.11-2012 (Stribog). The system model proposed by the authors is characterized by a comprehensive approach to electronic voting, namely detailing decisions at all stages of voting. The basic techniques for correct and safe conduct of electronic voting are described, such as the security of transmitted confidential data, the distribution of secret keys, the authentication of the parties, the verification of the transmitted data for integrity, the time control of the transmitted data. It shows how these techniques are implemented. Based on the developed algorithms, a model of the electronic voting system was implemented in C# .Net Framework programming language consisting of a set of window interface applications that interact with each other via network. The efficiency of the developed system is shown. Areas of improvement of the system are noted.