tuzsutТруды учебных заведений связиProceedings of Telecommunication Universities1813-324X2712-8830СПбГУТ10.31854/1813-324X-2023-9-2-128-142tuzsut-468Research ArticleИНФОРМАЦИОННЫЕ ТЕХНОЛОГИИ И ТЕЛЕКОММУНИКАЦИИINFORMATION TECHNOLOGIES AND TELECOMMUNICATIONМетоды защиты от угрозы неправильного заполнения избирательного бюллетеня в системе дистанционного электронного голосованияMethods of Protection against Threat: Incorrect Ballot Filling by Voter in the Remote Electronic Voting SystemЯковлевВ. А.YakovlevV.

доктор технических наук, профессор, профессор кафедры защищенных систем связи

Санкт-Петербург, 193232, Российская Федерация

St. Petersburg, 193232, Russian Federation

yakovlev.va@sut.ruhttps://orcid.org/0000-0003-4454-7844СалманВ. Д.SalmanV.

аспирант кафедры защищенных систем связи

Санкт-Петербург, 193232, Российская Федерация

St. Petersburg, 193232, Russian Federation

salman.vd@sut.ruСанкт-Петербургский государственный университет телекоммуникаций им. проф. М.А. Бонч-БруевичаРоссияThe Bonch-Bruevich Saint-Petersburg State University of TelecommunicationsRussian Federation20233005202392128142Copyright © Яковлев В.А., Салман В.Д., 20232023Яковлев В.А., Салман В.Д.Yakovlev V., Salman V.This work is licensed under a Creative Commons Attribution 4.0 License.https://tuzs.sut.ru/jour/article/view/468

Рассматривается обобщенная схема дистанционного электронного голосования, основанная на гомоморфном шифровании. Исследуются два метода защиты системы голосования от угрозы со стороны избирателя, заключающиеся в неправильном заполнении бюллетеня избирателем. Оба метода основаны на алгоритмах «доказательства с нулевым разглашением секрета». Получены оценки сложности вычислений при формировании доказательства корректности заполнения бюллетеня избирателем и оценки сложности проверки доказательства контролирующей стороной. Сравнительный анализ сложности реализации обоих методов показал, что метод, основанный на доказательстве на базе равенства логарифмов) имеет меньшую сложность вычислений на стороне избирателя по сравнению с методом, основанном на перемешивании голосов избирателей. В тоже время второй метод (перемешивания голосов) требует в 1,67 раза меньше вычислений в блокчейне, что становится существенным фактором выбора в пользу второго метода при большом количестве избирателей.

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.

система дистанционного электронного голосованиясхема Эль-Гамаля на эллиптической кривойсхема перемешиванияпроверка доказательства корректности заполнения бюллетенядоказательство с нулевым разглашением секретаthe elliptic ElGamal schemeremote electronic voting systemmixing schemeverification schemeproof of filling the ballotzero-knowledge proof systemReferencesFurukawa J., Mori K., Sako K. An implementation of a Mix-Net Based Network Voting Scheme and Its Use in a Private Organization // In Chaum D., Jakobsson M., Rivest R.L., Ryan P.Y.A., Benaloh J., Kutylowski M., Adida B. ed. Towards Trustworthy Elections. Lecture Notes in Computer Science. Vol. 6000. Berlin, Heidelberg: Springer, 2010. PP. 141–154. DOI:10.1007/978-3-642-12980-3_8Furukawa J., Mori K., Sako K. An implementation of a Mix-Net Based Network Voting Scheme and Its Use in a Private Organization. In Chaum D., Jakobsson M., Rivest R.L., Ryan P.Y.A., Benaloh J., Kutylowski M., Adida B. ed. Towards Trustworthy Elections. Lecture Notes in Computer Science. Vol. 6000. Berlin, Heidelberg: Springer; 2010. p.141–154. DOI:10.1007/978-3-642-12980-3_8Peng K. An efficient shuffling based eVoting scheme // Journal of Systems and Software. 2011. Vol. 84. № 6. PP. 906–922. DOI:10.1016/j.jss.2011.01.001Peng K. An efficient shuffling based eVoting scheme. Journal of Systems and Software. 2011;84(6):906–922. DOI:10.1016/j.jss.2011.01.001Peng K., Dawson E., Bao F. Modification and optimisation of a shuffling scheme: Stronger security, formal analysis and higher efficiency // International Journal of Information Security. 2011. Vol. 10. PP. 33–47. DOI:10.1007/s10207-010-0117-yPeng K., Dawson E., Bao F. Modification and optimisation of a shuffling scheme: Stronger security, formal analysis and higher efficiency. International Journal of Information Security. 2011;10:33–47. DOI:10.1007/s10207-010-0117-yAdida B. Helios: Web-based Open-Audit Voting // Proceedings of the 17th USENIX Security Symposium (San Jose, USA, 28 July–1 August 2008). 2008. PP. 335–348.Adida B. Helios: Web-based Open-Audit Voting. Proceedings of the 17th USENIX Security Symposium, 28 July–1 August 2008, San Jose, USA. 2008. p.335–348.Fujioka A., Okamoto T., Ohta K. A practical secret voting scheme for large scale elections // Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques «Advances in Cryptology ‒ AUSCRYPT '92» (Gold Coast, Australia, 13‒16 December 1992). Lecture Notes in Computer Science. Vol. 718. Berlin, Heidelberg: Springer, 1993. PP. 245–251. DOI:10.1007/3-540-57220-1_66Fujioka A., Okamoto T., Ohta K. A practical secret voting scheme for large scale elections. Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques «Advances in Cryptology ‒ AUSCRYPT '92», 13‒16 December 1992, Gold Coast, Australia. Lecture Notes in Computer Science, vol.718. Berlin, Heidelberg: Springer; 1993. p.245–251. DOI:10.1007/3-540-57220-1_66Ibrahim S., Kamat M., Salleh M., Aziz S.R.A. Secure E-voting with blind signature // Proceedings of the 4th National Conference of Telecommunication Technology, NCTT 2003, Shah Alam, Malaysia, 14‒15 January 2003). IEEE, 2003. PP. 193–197. DOI:10.1109/NCTT.2003.1188334Ibrahim S., Kamat M., Salleh M., Aziz S.R.A. Secure E-voting with blind signature. Proceedings of the 4th National Conference of Telecommunication Technology, NCTT 2003, 14‒15 January 2003, Shah Alam, Malaysia. IEEE; 2003. p.193–197. DOI:10.1109/NCTT.2003.1188334Mateu V., Sebé F., Valls M. Constructing credential-based E-voting systems from offline E-coin protocols // Journal of Network and Computer Applications. 2014. Vol. 42. PP. 39–44. DOI:10.1016/j.jnca.2014.03.009Mateu V., Sebé F., Valls M. Constructing credential-based E-voting systems from offline E-coin protocols. Journal of Network and Computer Applications. 2014;42:39–44. DOI:10.1016/j.jnca.2014.03.009Killer C., Rodrigues B., Scheid E.J., Franco M., Eck M., Zaugg N., et al. Provotum: A Blockchain-based and End-to-end Verifiable Remote Electronic Voting System // Proceedings of the 45th Conference on Local Computer Networks (LCN, Sydney, Australia, 16‒19 November 2020). IEEE, 2020. PP. 172–183. DOI:10.1109/LCN48667.2020.9314815Killer C., Rodrigues B., Scheid E.J., Franco M., Eck M., Zaugg N., et al. Provotum: A Blockchain-based and End-to-end Verifiable Remote Electronic Voting System. Proceedings of the 45th Conference on Local Computer Networks, LCN, 16‒19 November 2020, Sydney, Australia. IEEE; 2020. p.172–183. DOI:10.1109/LCN48667.2020.9314815Aziz A.A., Qunoo H.N., Samra A.A. Using Homomorphic Cryptographic Solutions on E-voting Systems // International Journal of Computer Network and Information Security. 2018. Vol. 12. Iss. 1. PP. 44‒59. DOI:10.5815/ijcnis.2018.01.06Aziz A.A., Qunoo H.N., Samra A.A. Using Homomorphic Cryptographic Solutions on E-voting Systems. International Journal of Computer Network and Information Security. 2018;12(1):44‒59. DOI:10.5815/ijcnis.2018.01.06Yang X., Yi X., Nepal S., Kelarev A., Han F. A secure Verifiable Ranked Choice Online Voting System Based on Homomorphic Encryption // IEEE Access. 2018. Vol. 6. PP. 20506–20519. DOI:10.1109/ACCESS.2018.2817518Yang X., Yi X., Nepal S., Kelarev A., Han F. A secure Verifiable Ranked Choice Online Voting System Based on Homomorphic Encryption. IEEE Access. 2018;6:20506–20519. DOI:10.1109/ACCESS.2018.2817518ElGamal T. A public key cryptosystem and a signature scheme based on discrete logarithms. Springer ‒ Verlag, 1998. URL: https://people.csail.mit.edu/alinush/6.857-spring-2015/papers/elgamal.pdf (дата обращения 10.04.2023)ElGamal T. A public key cryptosystem and a signature scheme based on discrete logarithms. Springer ‒ Verlag; 1998. URL: https://people.csail.mit.edu/alinush/6.857-spring-2015/papers/elgamal.pdf [Accessed 10th April 2023]Alonso L.P., GASCÓ M., del BLANCO D.Y.M., Alonso J.Á.H., Barrat J., Moreton H.A. E-Voting System Evaluation Based on the Council of Europe Recommendations: Helios Voting // IEEE Transactions on Emerging Topics in Computing. 2021. Vol. 9. Iss. 1. PP. 161–173. DOI:10.1109/TETC.2018.2881891Alonso L.P., GASCÓ M., del BLANCO D.Y.M., Alonso J.Á.H., Barrat J., Moreton H.A. E-Voting System Evaluation Based on the Council of Europe Recommendations: Helios Voting. IEEE Transactions on Emerging Topics in Computing. 2021;9(1):161–173. DOI:10.1109/TETC.2018.2881891Balzarotti D., Banks G., Cova M., Felmetsger V., Kemmerer R., Robertson W., et al. An experience in Testing the Security of Real-World Electronic Voting Systems // IEEE Transactions on Software Engineering. 2010. Vol. 36. Iss. 4. PP. 453–473. DOI:10.1109/TSE.2009.53Balzarotti D., Banks G., Cova M., Felmetsger V., Kemmerer R., Robertson W., et al. An experience in Testing the Security of Real-World Electronic Voting Systems. IEEE Transactions on Software Engineering. 2010;36(4):453–473. DOI:10.1109/TSE.2009.53Estehghari S., Desmedt Y. Exploiting the Client Vulnerabilities in Internet E-voting Systems: Hacking Helios 2.0 as an Example // Proceedings of the Electronic Voting Technology Workshop / Workshop on Trustworthy Elections (Washington, USA, 9–10 August 2010). 2010.Estehghari S., Desmedt Y. Exploiting the Client Vulnerabilities in Internet E-voting Systems: Hacking Helios 2.0 as an Example. Proceedings of the Electronic Voting Technology Workshop / Workshop on Trustworthy Elections, 9–10 August 2010, Washington, USA. 2010.Butterfield K., Zou X. Analysis and Implementation of Internet Based Remote Voting // Proceedings of the 11th International Conference on Mobile Ad Hoc and Sensor Systems (Philadelphia, USA, 28‒30 October 2014). IEEE, 2014. DOI:10.1109/MASS.2014.134Butterfield K., Zou X. Analysis and Implementation of Internet Based Remote Voting. Proceedings of the 11th International Conference on Mobile Ad Hoc and Sensor Systems, 28‒30 October 2014, Philadelphia, USA. IEEE; 2014. DOI:10.1109/MASS.2014.134Cramer R., Franklin M., Schoenmakers B., Yung M. Multi-Authority Secret-Ballot Elections with Linear Work // Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques (Saragossa, Spain, 12–16 May 1996). «Advances in Cryptology – EUROCRYPT ’96». Lecture Notes in Computer Science. Vol. 1070. Berlin, Heidelberg: Springer, 1996. PP. 72–83. DOI:10.1007/3-540-68339-9_7Cramer R., Franklin M., Schoenmakers B., Yung M. Multi-Authority Secret-Ballot Elections with Linear Work. Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques, 12–16 May 1996, Saragossa, Spain. «Advances in Cryptology – EUROCRYPT ’96». Lecture Notes in Computer Science, vol.1070. Berlin, Heidelberg: Springer; 1996. p.72–83. DOI:10.1007/3-540-68339-9_7Seol S., Kim H., Park J.H. An Efficient Open Vote Network for Multiple Candidates // IEEE Access. 2022. Vol. 10. PP. 124291–124304. DOI:10.1109/ACCESS.2022.3224798Seol S., Kim H., Park J.H. An Efficient Open Vote Network for Multiple Candidates. IEEE Access. 2022;10:124291–124304. DOI:10.1109/ACCESS.2022.3224798Hao F., Ryan P.Y.A., Zieliński P. Anonymous voting by two-round public discussion // IET Information Security. 2010. Vol. 4. Iss. 2. PP. 62–67. DOI:10.1049/iet-ifs.2008.0127Hao F., Ryan P.Y.A., Zieliński P. Anonymous voting by two-round public discussion. IET Information Security. 2010;4(2): 62–67. DOI:10.1049/iet-ifs.2008.0127Cramer R., Gennaro R., Schoenmakers B. A Secure and Optimally Efficient Multi-Authority Election Scheme // Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques (Konstanz, Germany, 11–15 May 1997) «Advances in Cryptology – EUROCRYPT ’97». Lecture Notes in Computer Science. Vol. 1233. Berlin, Heidelberg: Springer, 1997. PP. 103–118. DOI:10.1007/3-540-69053-0_9Cramer R., Gennaro R., Schoenmakers B. A Secure and Optimally Efficient Multi-Authority Election Scheme. Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques, 11–15 May 1997, Konstanz, Germany. «Advances in Cryptology – EUROCRYPT ’97». Lecture Notes in Computer Science, vol.1233. Berlin, Heidelberg: Springer, 1997. p.103–118. DOI:10.1007/3-540-69053-0_9Mateu V., Miret J.M., Sebé F. A hybrid approach to vector-based homomorphic tallying remote voting // International Journal of Information Security. 2016. Vol. 15. Iss. 2. PP. 211–221. DOI:10.1007/s10207-015-0279-8Mateu V., Miret J.M., Sebé F. A hybrid approach to vector-based homomorphic tallying remote voting. International Journal of Information Security. 2016;15(20):211–221. DOI:10.1007/s10207-015-0279-8Peng K. A general and efficient countermeasure to relation attacks in mix-based e-voting // International Journal of Information Security. 2011. Vol. 10. Iss. 1. PP. 49–60. DOI:10.1007/s10207-010-0122-1Peng K. A general and efficient countermeasure to relation attacks in mix-based e-voting. International Journal of Information Security. 2011;10(1):49–60. DOI:10.1007/s10207-010-0122-1Mohr A. A Survey of Zero-Knowledge Proofs with Applications to Cryptography. 2007. URL: http://austinmohr.com/Work_files/zkp.pdf (дата обращения 10.04.2023)Mohr A. A Survey of Zero-Knowledge Proofs with Applications to Cryptography. 2007. URL: http://austinmohr.com/Work_files/zkp.pdf [Accessed 10th April 2023]Blum M., Feldman P., Micali S. Non-interactive zero-knowledge and its applications // Proceedings of the 12-th annual ACM symposium on Theory of computing (Chicago, USA, 2‒4 May 1988). ACM, 1988. PP. 103–112. DOI:10.1145/62212.62222Blum M., Feldman P., Micali S. Non-interactive zero-knowledge and its applications. Proceedings of the 12-th annual ACM symposium on Theory of computing, 2‒4 May 1988, Chicago, USA. ACM; 1988. p.103–112. DOI:10.1145/62212.62222Huqing W., Zhixin S. Research on Zero-Knowledge Proof Protocol // International Journal of Computer Science Issues. 2013. Vol. 10. Iss. 1. PP. 194–200.Huqing W., Zhixin S. Research on Zero-Knowledge Proof Protocol. International Journal of Computer Science Issues. 2013;10(1):194–200.Feldman P. A practical scheme for non-interactive verifiable secret sharing // Proceedings of the 28th Annual Symposium on Foundations of Computer Science (Los Angeles, USA, 12‒14 October 1987). IEEE, 1987. PP. 427–437. DOI:10.1109/SFCS.1987.4Feldman P. A practical scheme for non-interactive verifiable secret sharing. Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 12‒14 October 1987, Los Angeles, USA. IEEE; 1987. p.427–437. DOI:10.1109/SFCS.1987.4Blum M., De Santis A., Micali S., Persiano G. Noninteractive Zero-Knowledge // SIAM Journal on Computing. 1991. Vol. 20. Iss. 6. DOI: 10.1137/0220068Blum M., De Santis A., Micali S., Persiano G. Noninteractive Zero-Knowledge. SIAM Journal on Computing. 1991;20(6). DOI: 10.1137/0220068Boruah D., Saikia M. Implementation of ElGamal Elliptic Curve Cryptography over prime field using C // Proceedings of the International Conference on Information Communication and Embedded Systems (ICICES2014, Chennai, India, 27‒28 February 2014). IEEE, 2014. DOI:10.1109/ICICES.2014.7033751Boruah D., Saikia M. Implementation of ElGamal Elliptic Curve Cryptography over prime field using C. Proceedings of the International Conference on Information Communication and Embedded Systems, ICICES2014, 27‒28 February 2014, Chennai, India). IEEE; 2014. DOI:10.1109/ICICES.2014.7033751Kapoor V., Abraham V.S., Singh R. Elliptic curve cryptography // Ubiquity. 2008. Vol. 9. Iss. 20. DOI:10.1145/1378355.1378356Kapoor V., Abraham V.S., Singh R. Elliptic curve cryptography. Ubiquity. 2008;9(20). DOI:10.1145/1378355.378356Коржик В.И., Яковлев В.А. Основы криптографии. СПб.: ИЦ Интермедия, 2016. 296 с.Korzhik V.I., Yakovlev V.A. Fundamentals of Cryptography. Saint Petersburg: IC Intermedia Publ.; 2016. 296 p. (in Russ.)

The authors declare that there are no conflicts of interest present.