Abstract
National scale electronic voting requires end to end verifiability, ballot secrecy, coercion resistance, and predictable performance. Existing blockchain systems do not provide at the same time guaranteed decryption without trust assumptions, formal coercion resistance proofs, logarithmic cost scaling, and complete verification across the election life-cycle. This work integrates dual-path tallying, deterministic ballot selection, blind signature credentials, and Layer-2 batching to realize these properties.
This architecture introduces four key innovations integrated across the election life cycle. First, a dual-path tallying mechanism enables cooperative fast-path decryption with logarithmic complexity when ceremony participants release factorization shares, while guaranteeing sequential VDF decryption within a bounded time window without cooperation. This enables result availability regardless of participant behavior. Second, deterministic ballot selection provides coercion resistance through multi-submission plausible deniability, enabling voters to self-correct while preventing adversarial late manipulation. Third, DK-QBS blind signatures, with their information-theoretic blindness and untraceability, produce unlinkable credentials that separate voter identity at registration from ballot anonymity during voting. Fourth, Layer-2 state-channels with periodic Merkle commitment achieve logarithmic on-chain cost scaling.
The formal security analysis presents nine theorems with concrete bounds on adversarial advantage, which prove ballot secrecy, voter anonymity, fairness, time-bounded privacy, eligibility, tally integrity, coercion resistance, and end to end verifiability under explicit cryptographic assumptions.
Implementation on the Fantom testnet together with computational projections demonstrates scalability to 100 million voters. Empirical measurements show registration completes within seconds per voter, vote casting sustains hundreds of votes per second with high efficiency, and tallying is guaranteed within one day on the VDF path or within minutes on the cooperative fast path. These performance characteristics establish feasibility of formally verified, privacy-preserving e-voting at national scale.