To Secure and Fast Transactions of E-Voting Using Blockchain Technology

Abstract

Democratic electoral processes rely fundamentally on the integrity, transparency, and confidentiality of vote recording and tallying. Conventional centralized e-voting infrastructures are susceptible to single-point-of-failure attacks, insider manipulation, and audit opacity, undermining public confidence in electoral outcomes. This paper proposes a novel blockchain-based e-voting architecture that integrates a hybrid consensus mechanism combining Practical Byzantine Fault Tolerance (PBFT) and Proof-of-Authority (PoA) to achieve simultaneously high transaction throughput, low confirmation latency, and strong Byzantine fault resilience. The system employs RSA-based digital signatures, zero-knowledge proofs (ZKP) for voter anonymity, and Ethereum-compatible smart contracts encoded in Solidity for automated ballot management and tamper-evident tallying. The proposed framework is evaluated through a simulated electoral environment involving up to 50,000 concurrent voters, demonstrating a peak throughput of 8,750 transactions per second (TPS), an average vote confirmation latency of 0.22 seconds, and a fault tolerance threshold of up to f = (n−1)/3 Byzantine nodes. Comparative analysis against Ethereum Proof-of-Work, standard PBFT, Hyperledger Fabric, and centralized database voting systems confirms that the proposed hybrid approach outperforms all baselines across throughput, latency, security, and scalability dimensions. The system achieves 97.8% integrity assurance and 95.3% voter anonymity preservation under adversarial network conditions, establishing a practically deployable, auditable, and voter-verifiable e-voting solution suitable for national-scale elections.