Geometric realization of electronic elections based on threshold secret sharing

Introduction. One of the tasks arising in cryptography is to ensure a safe and fair conduct of e-voting. This paper details the algorithm of electronic elections particularly that part which deals with the cryptographic security.

Materials and Methods. The results are obtained on the basis of the following methodology: finite field theory, projective geometry, and linear algebra. The developed cryptosystem is based on the application of geometric objects from projective geometry over finite fields.

Research Results. The invented algorithm relies on the ElGamal encryption and a new geometric way of secret sharing among election committees. The proposed method uses some features of affine spaces over finite fields to generate special geometric constructions and secret, search of which is a complex algorithmic task for an illegal intruder. The threshold secret sharing is used to prevent voter fraud on the part of the members of election committees. The probability to generate the right share of secret by an illegal intruder in case when he/she knows only a part of secret shares is determined.

Discussion and Conclusions. The described scheme is useful for electronic voting and in other spheres where methods of threshold cryptography are applied.

1. Mogilevskaya, N.S., Kulbikayan, R.V., Zhuravlev, L.A. Porogovoe razdelenie faylov na osnove bitovykh masok: ideya i vozmozhnoe primenenie. [Threshold file sharing based on bit masks: concept and possible use.] Vestnik of DSTU, 2011, vol. 11, no. 10, pp. 1749–1755 (in Russian).

2. Rubin, A. D. Security considerations for remote electronic voting. Communications of the ACM, 2002, vol. 45(12), pp. 39–44.

3. Kiayias, A., Korman, M., Walluck, D. An Internet voting system supporting user privacy. ACSAC’06: Proceedings of the 22nd Annual Computer Security Applications Conference, 2006, pp. 165–174.

4. Jefferson, D., Rubin, A. D., Simons, B., Wagner, D. Analyzing internet voting security. Communications of the ACM, 2004, vol. 47(10), pp. 59–64.

5. Chaum, D. Secret-ballot receipts: True voter-verifiable elections. IEEE Security and Privacy, 2004, vol. 2(1), pp. 38–47.

6. Alferov, A.P., Zubov, A.Yu., Kuzmin, A.S., Cheremushkin, A.V. Osnovy kriptografii: uchebnoe posobie. [Basics of Cryptography.] Moscow: Gelios-ARV, 2001, 480 p. (in Russian).

7. Ryabko. B.Ya., Fionov, A.N. Kriptograficheskie metody zashchity informatsii. [Cryptographic methods of information protection.] Moscow: Hot line -Telekom, 2005, 229 p. (in Russian).

8. Koblitz, N. Kurs teorii chisel i kriptografii. [Course of number theory and cryptography.] Moscow: TVP, 2001, 254 p. (in Russian).

9. Koblitz, N. Kurs teorii chisel i kriptografii. [Course of number theory and cryptography.] Moscow: TVP, 2001, 254 p. (in Russian).

10. Kostrikin, A.I. Vvedenie v algebru. [Introduction to Algebra.] Moscow: MTsNMO, 2009, 368 p. (in Russian).

11. Ian, F. Blake, Garefalakis, Theo. On the complexity of the discrete logarithm and Diffie-Hellman problems. J. Complex, 2004, vol. 20(2-3), pp. 148–170.