Blockchain-enabled smart contracts and prioritized delegated proof-of-stake paradigm for secure and scalable electronic voting systems

Abstract

Existing electronic voting systems suffer from security concerns, identity theft, electoral fraud, and insufficient transparency in digital voting systems, which pose significant challenges to electoral integrity. Blockchain-based electronic voting systems provide immutability and decentralization. However, they are inappropriate for large-scale elections because of their inadequate consensus mechanisms, scalability issues, and security weaknesses. To provide an equitable electoral process, an electronic voting system must be scalable, secure, and efficient. This method requires real-time vote verification, secure vote recording to avert fraud, and voter authentication.

This study introduces a blockchain-based smart contract electronic voting system (BCVS) to improve the security and efficiency of electronic voting. The three algorithms are employed by the proposed BCVS to safeguard and improve the electronic voting process via the utilization of smart contracts. These algorithms ensure the precise tabulation of results and establish a robust foundation for electronic voting by resolving disputes. The proposed approach ensures transparency, immutability, and a minimal likelihood of manipulation through the utilization of the prioritized delegated proof-of-stake (PDPoS) consensus mechanism. The PDPoS functions on Tier 3 scalable networks and diligently documents transactions on the blockchain to resolve critical challenges associated with electronic voting. The scalability and integrity of the proposed e-voting system are ensured through the implementation of a practical Byzantine fault tolerance algorithm. Improved voter authentication is accomplished by multi-factor authentication and elliptic curve digital signatures, reducing the dangers of unwanted access. Additionally, Nightshade sharding from the NEAR algorithm enhances scalability by partitioning the blockchain network into numerous smaller shards, facilitating parallel transaction processing. Consequently, throughput is markedly enhanced, and latency is diminished. The testing results indicate that the proposed BCVS achieves 100% confirmed transactions, 98% compatibility, 95% accuracy, and 95% audited votes. The proposed BCVS outperforms existing state-of-the-art systems in multiple essential domains, such as the volume of votes cast within a specified timeframe, precision, interoperability with other systems, quantity of confirmed transactions, auditability, and duration of vote counting.