|
Scientific Part
Mathematics
On application of elliptic curves in some electronic voting protocols
S. M. Ratseeva, O. I. Cherevatenkob a Ulyanovsk State University, 42, Lev Tolstoy Str.,
Ulyanovsk, Russia, 432017
b Ulyanovsk State I. N. Ulyanov Pedagogical University,
4, Ploshchad’ 100-letiya so dnya rozhdeniya V. I. Lenina, Ulyanovsk, Russia, 432063
Abstract:
Electronic voting protocols allow us to carry out voting procedure in which ballots exist only electronically. These protocols provide the secret nature of vote. The main property of electronic voting protocols is the universal checkability, i.e. provision of an opportunity to any person interested, including detached onlookers to check correctness of counting of votes at any moment. In operation cryptography protocols of electronic vote of Shauma–Pederson and Kramera–Franklin–Shoyenmeykersa–Yunga are considered. These protocols are provided on the basis of elliptic curves which application allows us to reduce considerably the sizes of parameters of protocols and to increase their cryptography firmness. Primary benefit of elliptic cryptography is that any subexponential algorithm of the decision of the task of the discrete logarithming in group of points of an elliptic curve is not known at the moment.
Key words:
electronic voting protocol, bit obligation, diagram of division of a secret.
Citation:
S. M. Ratseev, O. I. Cherevatenko, “On application of elliptic curves in some electronic voting protocols”, Izv. Saratov Univ. Math. Mech. Inform., 18:1 (2018), 62–68
Linking options:
https://www.mathnet.ru/eng/isu745 https://www.mathnet.ru/eng/isu/v18/i1/p62
|
Statistics & downloads: |
Abstract page: | 304 | Full-text PDF : | 155 | References: | 46 |
|