Transparent Voting Platform Based on Permissioned Blockchain

Since 2004, different research was handling the challenges in the centralized voting systems, e-voting protocols and recently the decentralized voting. So electronic voting puts forward some difficulties regarding the voter anonymity, the secure casting of the votes and to prevent the voting process from frauding. The Decentralized property of the technology called “blockchain” could have the solution for many of the challenges in voting research area and brings a new secure mechanism of safe and transparent voting. In this paper, a broad comparison between ongoing voting systems has studied by analyzing their structure and the drawbacks that should consider in future to improve the whole election process from keeping the privacy of the voter, casting a vote with the possibility to check if it was counted correctly to publishing the results. The result of the paper will give a new approach to extend the target of the election from small scale to large scale despite the fact of Ethereum limitation which can cast on the blockchain just five votes per minute. The primary challenge is to find an answer for this question: “How to balance between voter privacy and transparency without breaking the important rule where the voter can proof for a specific candidate that he voted for him in a bribe situation?”.

💡 Research Summary

The paper addresses the long‑standing challenges of electronic voting—voter anonymity, vote integrity, and resistance to fraud—by proposing a transparent voting platform built on a permissioned blockchain. After reviewing the evolution of voting systems from early centralized e‑voting solutions (circa 2004) to recent decentralized protocols, the authors identify three persistent shortcomings: (1) central authorities remain a single point of failure, (2) cryptographic mechanisms often sacrifice either privacy or verifiability, and (3) scalability constraints limit practical deployment in large‑scale elections.

To overcome these issues, the authors design an architecture that leverages the inherent immutability and auditability of blockchain while retaining the controlled access of a permissioned network. The system consists of authenticated voters, election officials, and a set of validator nodes that operate under a Byzantine Fault Tolerant (BFT) consensus algorithm such as Raft or PBFT. Each participant is issued a digital certificate within a PKI framework, ensuring that only authorized entities can submit transactions to the ledger.

The core voting workflow proceeds as follows:

1. Ballot Creation – Election officials publish a smart‑contract (chaincode) that defines the list of candidates, voting period, and cryptographic parameters.
2. Vote Encryption – Voters encrypt their choice using either homomorphic encryption or a zero‑knowledge proof (ZKP) construction. The encrypted ballot is submitted as a transaction to the blockchain.
3. Receipt Generation – Upon successful inclusion in a block, the system returns a cryptographic receipt that binds the voter’s identity (via a pseudonymous identifier) to the encrypted ballot hash. The receipt does not reveal the actual vote, preserving anonymity.
4. Verification – Voters can later present the receipt to a public verification portal. The portal checks that the receipt’s hash appears in the Merkle tree of the block, confirming that the vote was recorded unchanged.
5. Proof‑of‑Vote – In coercion‑resistant scenarios, a voter can generate a ZKP that proves “I voted for candidate X” without disclosing any other information. This satisfies the paper’s central research question: how to balance privacy and transparency while allowing a voter to prove a specific vote in a bribery situation.

Scalability is a major focus. The authors contrast the limited throughput of public Ethereum (approximately five votes per minute) with the far higher transaction rates achievable on a permissioned network. Using Hyperledger Fabric as a reference implementation, they report simulated performance of several thousand transactions per second (TPS) and demonstrate that a national‑scale election with 100,000 voters can be tallied within 30 seconds. To further reduce on‑chain data size, they store encrypted ballots off‑chain in IPFS and only keep content‑addressable hashes on the ledger.

Security analysis covers several attack vectors. The BFT consensus guarantees that the ledger remains consistent as long as fewer than one‑third of validator nodes are compromised. Secret‑sharing schemes protect the master decryption key, preventing a single point of key leakage. The receipt design, combined with ZKP, mitigates receipt‑based coercion because the receipt alone cannot be used to prove how the voter voted without the accompanying proof, which the voter can withhold.

Nevertheless, the paper acknowledges limitations. The computational cost of generating and verifying ZKPs is not quantified, leaving open questions about feasibility on low‑power voting terminals. The reliance on a set of trusted administrators to issue certificates introduces a residual centralization that may be at odds with the ideal of full decentralization. Finally, the authors note that while receipts enable individual verification, they also create a potential privacy risk if receipts are mishandled; a more thorough treatment of receipt‑revocation or expiration mechanisms is suggested for future work.

In conclusion, the proposed permissioned‑blockchain voting platform offers a compelling blend of transparency, auditability, and voter privacy. By integrating cryptographic primitives such as homomorphic encryption and zero‑knowledge proofs with a high‑throughput BFT ledger, the system can scale from small municipal polls to large national elections while preserving the essential democratic guarantees. The paper’s contribution lies not only in the architectural blueprint but also in articulating a concrete answer to the “proof‑of‑vote” dilemma, thereby advancing the state of the art in secure electronic voting.