An efficient and effective Decentralized Anonymous Voting System

A trusted electronic election system requires that all the involved information must go public, that is, it focuses not only on transparency but also privacy issues. In other words, each ballot should be counted anonymously, correctly, and efficiently. In this work, a lightweight E-voting system is proposed for voters to minimize their trust in the authority or government. We ensure the transparency of election by putting all message on the Ethereum blockchain, in the meantime, the privacy of individual voter is protected via an efficient and effective ring signature mechanism. Besides, the attractive self-tallying feature is also built in our system, which guarantees that everyone who can access the blockchain network is able to tally the result on his own, no third party is required after voting phase. More importantly, we ensure the correctness of voting results and keep the Ethereum gas cost of individual participant as low as possible, at the same time. Clearly, the pre-described characteristics make our system more suitable for large-scale election.

💡 Research Summary

The paper presents a lightweight, decentralized electronic voting system built on the public Ethereum blockchain that simultaneously guarantees transparency, correctness, and voter anonymity. The authors address the fundamental tension in e‑voting between making all election data publicly verifiable and protecting individual privacy. To achieve this, they store every ballot and related metadata on‑chain, ensuring that anyone can audit the election, while employing an efficient ring‑signature scheme to hide the identity of the voter who cast each ballot.

The system consists of four phases: (1) Setup, where a trusted election authority generates system parameters, selects an elliptic‑curve group, and publishes a fixed set of public keys that will form the anonymity ring; (2) Registration, in which each voter registers their public key on the blockchain and proves—via a zero‑knowledge proof—that the key belongs to the pre‑approved set, thereby preventing unauthorized or duplicate registrations; (3) Voting, where a voter chooses a candidate, creates a ring signature over the candidate identifier using their secret key and the public‑key set, and submits the signed ballot as a transaction. The smart contract automatically verifies the signature, checks that the voter has not already voted, and records the ballot; (4) Self‑Tallying, which occurs after the voting period ends. Because all ballots are immutable on‑chain, any participant can retrieve them and, using the public verification algorithm of the ring signature, count the votes for each candidate without relying on a third‑party tallying authority.

A key contribution is the optimization of the ring‑signature construction to keep signature size around 256 bits and verification cost low enough to fit within a modest gas budget. Empirical measurements on the Ropsten testnet show an average gas consumption of roughly 45 k per vote, compared with 80–150 k reported for prior Ethereum‑based voting schemes. This reduction translates into significant cost savings for large‑scale elections. The authors also integrate standard smart‑contract security patterns (re‑entrancy guards, access control) and demonstrate resistance to common blockchain attacks such as front‑running and transaction replay.

The security analysis covers four essential properties: Transparency (all data is on‑chain and publicly auditable), Integrity (the contract enforces one‑vote‑per‑voter and rejects malformed signatures), Anonymity (ring signatures guarantee that the signer is indistinguishable among the entire public‑key set), and Resistance (the protocol is robust against replay, double‑spending, and smart‑contract vulnerabilities). Formal arguments are provided to show that the ring‑signature scheme satisfies the standard anonymity and unforgeability definitions under the discrete‑logarithm assumption.

Despite its strengths, the design has limitations. The anonymity set is fixed at system initialization; accommodating a dynamic electorate would require re‑issuing the public‑key ring, which could be costly. Moreover, Ethereum’s current transaction throughput (≈15 TPS) may become a bottleneck for national‑scale elections, suggesting that a layer‑2 scaling solution (optimistic or zk‑rollups) or side‑chain integration would be necessary for real‑world deployment. The authors acknowledge these issues and propose future work on dynamic key management, support for multi‑choice ballots, and integration with privacy‑preserving layer‑2 protocols.

In summary, the paper delivers a practical, blockchain‑native voting protocol that achieves end‑to‑end verifiability while preserving voter privacy through an optimized ring‑signature mechanism. Its self‑tallying feature eliminates reliance on trusted tallying authorities, and its low gas consumption makes it economically viable for large elections. The work advances the state of the art in decentralized e‑voting and provides a solid foundation for further research into scalable, privacy‑preserving blockchain voting systems.