Geodesic
Remote voting protocols. ~II
Matematičeskie voprosy kriptografii, Tome 15 (2024), pp. 83-100.

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

The study of remote voting protocols resistant to the compromise of given number of voters is continued. It is shown that secret sharing schemes may be used for the contruction of remote voting protocols with the guaranteed level of resistance. Suggested remote voting protocols are compared with other known ones. 
@article{MVK_2024_15_a4,
     author = {O. A. Kozlitin},
     title = {Remote voting protocols. {~II}},
     journal = {Matemati\v{c}eskie voprosy kriptografii},
     pages = {83--100},
     publisher = {mathdoc},
     volume = {15},
     year = {2024},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MVK_2024_15_a4/}
}
TY  - JOUR
AU  - O. A. Kozlitin
TI  - Remote voting protocols. ~II
JO  - Matematičeskie voprosy kriptografii
PY  - 2024
SP  - 83
EP  - 100
VL  - 15
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MVK_2024_15_a4/
LA  - ru
ID  - MVK_2024_15_a4
ER  - 
%0 Journal Article
%A O. A. Kozlitin
%T Remote voting protocols. ~II
%J Matematičeskie voprosy kriptografii
%D 2024
%P 83-100
%V 15
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MVK_2024_15_a4/
%G ru
%F MVK_2024_15_a4
O. A. Kozlitin. Remote voting protocols. ~II. Matematičeskie voprosy kriptografii, Tome 15 (2024), pp. 83-100. http://geodesic.mathdoc.fr/item/MVK_2024_15_a4/

[1] Cheremushkin A. V., Kriptograficheskie protokoly. Osnovnye svoistva i uyazvimosti, Akademiya, M., 2009, 272 pp.

[2] Kozlitin O. A., Suleimanov M. A., “Protokoly distantsionnogo golosovaniya. I”, Matematicheskie voprosy kriptografii, 14:4 (2023), 89–110 | DOI | MR | Zbl

[3] Cramer R., Franklin M., Schoenmakers B., Yung M., “Multi-authority secret ballot elections with linear work”, EUROCRYPT'96, Lect. Notes Comput. Sci., 1070, 1996, 72–83 | DOI | MR | Zbl

[4] Shamir A., “How to Share a Secret”, Comm. ACM, 22 (1979), 612–613 | DOI | MR | Zbl

[5] B. A. Pogorelov, V. N. Sachkov (red.), Clovar kriptograficheskikh terminov, MTsNMO, M., 2006, 94 pp.

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

[7] Breitner J., “Biased nonce sense: lattice attacks against weak ECDSA signatures in cryptocurrencies”, 23rd Int. Conf., FC 2019, Lect. Notes Comput. Sci., 11598, 2019, 3–20 | DOI | Zbl

[8] Fujioka A., Okamoto T., Ohta K., “A practical secret voting scheme for largescale elections”, AUSCRYPT'92, Lect. Notes Comput. Sci., 718, 1993, 244–251 | DOI | Zbl

[9] He Q., Su Z., “A new practical secure e-voting scheme”, Proc. 14th Int. Inf. Security Conf., IFIP/SEC'98, Austr. Comput. Soc., 1998, 196–205

[10] Lavrov D. N., Lavrova D. D., “Model arkhitektury prilozheniya, realizuyuschego skhemu elektronnogo tainogo golosovaniya He-Su”, Matem. strukt. i modelir., 4 (68) (2023), 111–119

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

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

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