Geodesic
Remote voting protocols.~I
Matematičeskie voprosy kriptografii, Tome 14 (2023), pp. 89-110.

Voir la notice de l'article provenant de la source Math-Net.Ru

On the basis of orthomorphisms of abelian groups, a post-quantum cryptographic protocol for remote voting has been built, which is resistant to the compromise of a single subscriber. Conditions under which the protocol is resistant to compromise of two subscribers have been found. 
@article{MVK_2023_14_a4,
     author = {O. A. Kozlitin and M. A. Suleymanov},
     title = {Remote voting {protocols.~I}},
     journal = {Matemati\v{c}eskie voprosy kriptografii},
     pages = {89--110},
     publisher = {mathdoc},
     volume = {14},
     year = {2023},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MVK_2023_14_a4/}
}
TY  - JOUR
AU  - O. A. Kozlitin
AU  - M. A. Suleymanov
TI  - Remote voting protocols.~I
JO  - Matematičeskie voprosy kriptografii
PY  - 2023
SP  - 89
EP  - 110
VL  - 14
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MVK_2023_14_a4/
LA  - ru
ID  - MVK_2023_14_a4
ER  - 
%0 Journal Article
%A O. A. Kozlitin
%A M. A. Suleymanov
%T Remote voting protocols.~I
%J Matematičeskie voprosy kriptografii
%D 2023
%P 89-110
%V 14
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MVK_2023_14_a4/
%G ru
%F MVK_2023_14_a4
O. A. Kozlitin; M. A. Suleymanov. Remote voting protocols.~I. Matematičeskie voprosy kriptografii, Tome 14 (2023), pp. 89-110. http://geodesic.mathdoc.fr/item/MVK_2023_14_a4/

[1] Bonetti P., Ravaioli S., Piergallini S., “The Italian academic community's electronic voting system”, Computer Networks, 34 (2000), 851–860 | DOI

[2] Chang C.-C., Wu W.-B., “A secure voting system on a public network”, Networks, 29 (1997), 81–87 | 3.0.CO;2-7 class='badge bg-secondary rounded-pill ref-badge extid-badge'>DOI | Zbl

[3] Chen Y.-Y., Jan J.-K., Chen C.-L., “The design of a secure anonymous Internet voting system”, Computers Security, 23 (2004), 330–337 | DOI

[4] Chiang L., “Trust and security in the e-voting system”, Electr. Government, Int. J., 6:4 (2009), 343–359 | DOI

[5] Dini G., “Electronic voting in a large-scale distributed system”, Networks, 38 (2001), 22–32 | DOI | MR | Zbl

[6] Dini G., “A secure and available electronic voting service for a large-scale distributed system”, Future Gener. Comput. Syst., 19 (2003), 69–85 | DOI | MR | Zbl

[7] Levitin G., “Maximizing survivability of vulnerable weighted voting system”, Reliab. Eng. Syst. Safety, 83 (2004), 17–26 | DOI

[8] Shelley F. M., “Voting power in a system of compound majority rule”, Math. Soc. Sci., \break9 (1985), 287–291 | DOI | MR | Zbl

[9] Zwierko A., Kotulski Z., “Light-weight e-voting system with distributed trust”, Electr. Notes Theor. Comput. Sci., 168 (2007), 109–126 | DOI

[10] Shnaier B., Sekrety i lozh. Bezopasnost dannykh v tsifrovom mire, Piter, SPb., 2003, 368 pp.

[11] Benaloh J., Tuinstra D., “Receipt-free secret-ballot elections”, Twenty-Sixth Annu. ACM Symp. Theory of Computing, ACM, 1994, 544–553 | DOI | Zbl

[12] Okamoto T., “Receipt-free electronic voting schemes for large scale elections”, Proc. Secur. Protocols Workshop, Lect. Notes Comput. Sci., 1361, Springer-Verlag, 1997, 25–37 | DOI

[13] Juels A., Jakobson M., Coercion-resistant electronic elections, 2002 http://www.voteauction.net/ṼOTEAUCTION/165.pdf

[14] Hirt M., Sako K., “Efficient receipt-free voting based on homomorphic encryption”, EUROCRYPT'00, Lect. Notes Comput. Sci., 1807, 2000, 539–556 | DOI | MR | Zbl

[15] {Cherëmushkin}\;A. V., Kriptograficheskie protokoly, M.: Izd. tsentr «Akademiya», 2009, 272 pp.

[16] Vaichikauskas M. A., Metody i protokoly psevdoveroyatnostnogo zaschitnogo preobrazovaniya informatsii dlya tekhnologii tainogo elektronnogo golosovaniya, Dis. ... kand. tekhn. nauk, SPb., 2017, 110 pp.

[17] Memorandum on promoting United States leadership in quantum computing while mitigating risk to vulnerable cryptographic systems, 2022 http://www.whitehouse.gov/briefing-room/statements-releases/2022/05/04/

[18] Rostelekom, Obzor kriptograficheskogo protokola sistemy distantsionnogo elektronnogo golosovaniya, 2020 http://habr.com/ru/company/rostelecom/blog/519178/

[19] Golosovanie po popravkam k konstitutsii RF. Zachem bylo vnedryat blokchein, 2020 http://www.rbc.ru/crypto/news/5efc2b519a79477d32ad3fb1?from=main

[20] Shannon C. E., “Communications theory of secrecy systems”, Bell Syst. Tech. J., 28 (1949), 656–715 | DOI | MR | Zbl

[21] Agievich S. V., Bernik V. I., Matveev G. V., Kharin Yu. S., Matematicheskie i kompyuternye osnovy kriptologii, Uchebnoe posobie, Novoe znanie, Minsk, 2003, 382 pp.

[22] Polozhenie o sovete po zaschite dissertatsii na soiskanie uchenoi stepeni kandidata nauk, na soiskanie uchenoi stepeni doktora nauk, Utverzhdeno prikazom Ministerstva obrazovaniya i nauki Rossiiskoi Federatsii ot 10 noyabrya 2017 g. No 1093

[23] Johnson D. M., Dulmage A. L., Mendelsohn N. S., “Orthomorphisms of groups and orthogonal Latin squares, I”, Canad. J. Math., 13 (1961), 356–372 | DOI | MR | Zbl

[24] Menyachikhin A. V., “Metod ogranichennogo defitsita i zadacha postroeniya ortomorfizmov i pochti ortomorfizmov abelevykh grupp”, Diskretnaya matematika, 31:3 (2019), 58–77 | DOI | MR

[25] Menyachikhin A. V., “Ortomorfizmy abelevykh grupp s minimalno vozmozhnymi poparnymi rasstoyaniyami”, Diskretnaya matematika, 30:4 (2018), 55–65 | DOI | MR

[26] Sachkov V. N., Kurs kombinatornogo analiza, NITs «Regulyarnaya i khaotichnaya dinamika» 2013, M.–Izhevsk, 335 pp.

[27] Hall M., “A combinatorial problem on Abelian groups”, Proc. Amer. Math. Soc., 3:4 (1952), 584–587 | DOI | MR | Zbl

[28] McKay B. D., McLeod J. C., Wanless I. M., “The number of transversals in a Latin square”, Designs, Codes and Cryptography, 40:3 (2006), 269–284 | DOI | MR | Zbl

[29] Shimanski, N. L., Orthomorphisms of Boolean groups, PhD thesis, Portland State Univercity, 2016, 91 pp. | MR

[30] Glukhov M. M., Elizarov V. P., Nechaev A. A., Algebra, Uchebnik, 2-e izd., ispr. i dop., Lan, SPb., 2015, 608 pp.