Post-Quantum Electronic Voting from Lattices: Constructions, Performance, and Open Problems

This article investigates the security of electronic voting systems in the context of post-quantum cryptography. The main objective of the study is to systematize existing post-quantum voting protocols and evaluate their capabilities in the face of the “harvest-now, decrypt-later” threat arising from the anticipated emergence of cryptographically relevant quantum computers. To achieve this objective, a taxonomy of post-quantum voting protocols based on their tallying architectures is presented. The study examines approaches based on homomorphic commitments, verifiable mix-nets with distributed decryption, lattice-based zero-knowledge proofs, and fully homomorphic encryption. Using a comparative analysis method, the protocols are evaluated according to common security and functionality criteria, while published performance figures are systematized with explicit consideration of the limitations in their comparability due to inconsistent parameters and evaluation metrics. The results of the study reveal several major unresolved challenges in this field. In particular, verifiable threshold (t-of-n) tallying is identified as a significant open problem: existing protocols that preserve tally verifiability even in the event of collusion among all authorities require the participation of every authority, whereas threshold-based schemes either fail to provide public verifiability or compromise integrity when t authorities collude. Furthermore, the study identifies several important directions for future research, including modulus selection for commitment-based protocols, post-quantum coercion resistance, everlasting privacy, and the development of a standardized benchmarking methodology.

Authors

Institutions

Publication Details

Journal
Herald of the Azerbaijan Engineering Academy
Published
2026-11-18
DOI
https://doi.org/10.52171/herald.482
Primary Topic
Internet Traffic Analysis and Secure E-voting
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Post-Quantum Electronic Voting from Lattices: Constructions, Performance, and Open Problems

J.J. Alizadeh
1 links
Herald of the Azerbaijan Engineering Academy
Internet Traffic Analysis and Secure E-voting
article

Post-Quantum Electronic Voting from Lattices: Constructions, Performance, and Open Problems

J.J. Alizadeh
article en

Abstract

This article investigates the security of electronic voting systems in the context of post-quantum cryptography. The main objective of the study is to systematize existing post-quantum voting protocols and evaluate their capabilities in the face of the “harvest-now, decrypt-later” threat arising from the anticipated emergence of cryptographically relevant quantum computers. To achieve this objective, a taxonomy of post-quantum voting protocols based on their tallying architectures is presented. The study examines approaches based on homomorphic commitments, verifiable mix-nets with distributed decryption, lattice-based zero-knowledge proofs, and fully homomorphic encryption. Using a comparative analysis method, the protocols are evaluated according to common security and functionality criteria, while published performance figures are systematized with explicit consideration of the limitations in their comparability due to inconsistent parameters and evaluation metrics. The results of the study reveal several major unresolved challenges in this field. In particular, verifiable threshold (t-of-n) tallying is identified as a significant open problem: existing protocols that preserve tally verifiability even in the event of collusion among all authorities require the participation of every authority, whereas threshold-based schemes either fail to provide public verifiability or compromise integrity when t authorities collude. Furthermore, the study identifies several important directions for future research, including modulus selection for commitment-based protocols, post-quantum coercion resistance, everlasting privacy, and the development of a standardized benchmarking methodology.

Herald of the Azerbaijan Engineering AcademyVol. 18(3)
Azerbaijan Technical University (AZ)
Peace, justice, and strong institutions
Internet Traffic Analysis and Secure E-voting
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon