Development of cryptographic methods and algorithms for electronic voting systems
PhD in Information Systems and Processes (since 2024), Department of Cybersecurity, Azerbaijan Technical University
01
Thesis
An election needs two things at once: every ballot stays secret, and anyone can check that the tally is right. Most practical e-voting schemes get this from factoring or discrete logarithms, which a large quantum computer would break.
My PhD develops cryptographic methods for electronic voting built on lattices: homomorphic tallying, commitments with zero-knowledge proofs, threshold tallying shared by several election authorities, and concrete parameters that can be checked and deployed.
- Post-quantum e-voting
- Lattice-based commitments
- Threshold cryptography
- Homomorphic tallying
- Verifiability
- Concrete parameters
02
Latest preprint
Cryptology ePrint Archive · 2026/2500
Threshold Post-Quantum E-Voting from Lattice Commitments
T-EVOLVE is a threshold version of the lattice-based e-voting protocol EVOLVE. Votes are Shamir-shared over the commitment message space, so any t of n election authorities can finish the tally: privacy holds against t − 1 colluding authorities, and the tally stays verifiable even if all of them collude.
Complaints between authorities, including about ciphertexts that do not decrypt, can be checked by anyone. The paper proves privacy, verifiability, individual verifiability and robustness, and comes with a C implementation.
t of nauthorities finish the tally
109 KByes/no ballot, 4 authorities
≈ 3 minto aggregate 10⁴ ballots on one core
How T-EVOLVE works, step by step
An interactive walk-through of the protocol: a ballot is committed and shared, authorities check it, and any t of them reconstruct the tally.
Coming soon04
Code
Research code: not constant-time and not audited. Do not use it to run elections.
t-evolve-cryptoalgCReference implementation of T-EVOLVE and of EVOLVE's ballot on the same code base: ring arithmetic with NTT, Gaussian samplers, BDLOP commitments, Shamir sharing, proofs, aggregation and tally. Runs the benchmarks of the paper.evolve_cCReference implementation of the core of EVOLVE (del Pino, Lyubashevsky, Neven, Seiler, CCS 2017), the protocol T-EVOLVE builds on.pq-evoting-paramsPythonRe-estimates the concrete security of published lattice-based e-voting parameter sets with one fixed version of the lattice estimator, with full logs.pailliervsbfvPythonExperiments for the comparison of Paillier and BFV as the encryption layer of an e-voting system.