S3Voting: A Blockchain Sharding Based E-Voting Approach With Security and Scalability

Electronic voting plays a crucial role in facilitating democratic and convenient decision-making in people’s lives. However, implementing an electronic voting system poses challenges, such as meeting the stringent security requirements for anonymity, fairness, and verifiability. Another concern is the performance degradation when dealing with a large number of voters. In this paper, we propose <inline-formula><tex-math notation="LaTeX">$S^{3}$</tex-math></inline-formula>Voting, a blockchain sharding-based e-voting scheme that addresses these challenges. By combining robust security and scalability, <inline-formula><tex-math notation="LaTeX">$S^{3}$</tex-math></inline-formula>Voting provides reliable technical support for conducting large-scale elections. Utilizing advanced technologies such as <i>Homomorphic Time-Lock Puzzle (HTLP)</i> and <i>one-time ring signature</i>, the system safeguards voters’ privacy and ballot confidentiality. The approach involves dividing voters and miners into smaller shards, and implementing shard managing mechanisms to ensure security and enhance system efficiency. Through thorough security analysis, we demonstrate that <inline-formula><tex-math notation="LaTeX">$S^{3}$</tex-math></inline-formula>Voting not only meets the fundamental security requirements of e-voting but also offers verifiability and strong robustness-essential elements for successful large-scale elections. Moreover, experimental results indicate that <inline-formula><tex-math notation="LaTeX">$S^{3}$</tex-math></inline-formula>Voting significantly reduces the computational burden on individual miners and minimizes system processing time compared to existing blockchain-based e-voting solutions.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Dependable and Secure Computing
Published
2024-08-20
DOI
https://doi.org/10.1109/tdsc.2024.3446392
Citations
9
Primary Topic
Internet Traffic Analysis and Secure E-voting
Type
article
Field-Weighted Citation Impact
3.13
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

S3Voting: A Blockchain Sharding Based E-Voting Approach With Security and Scalability

Meiqi Li, Kaiping Xue, David S. L. Wei, Jun Lu et al.
9 citations
IEEE Transactions on Dependable and Secure Computing
Internet Traffic Analysis and Secure E-voting
3.13
article

S3Voting: A Blockchain Sharding Based E-Voting Approach With Security and Scalability

Meiqi Li, Kaiping Xue, David S. L. Wei, Jun Lu, Qibin Sun, Wentuo Sun, Xinyi Luo
article en
9 citations

Abstract

Electronic voting plays a crucial role in facilitating democratic and convenient decision-making in people’s lives. However, implementing an electronic voting system poses challenges, such as meeting the stringent security requirements for anonymity, fairness, and verifiability. Another concern is the performance degradation when dealing with a large number of voters. In this paper, we propose <inline-formula><tex-math notation="LaTeX">$S^{3}$</tex-math></inline-formula>Voting, a blockchain sharding-based e-voting scheme that addresses these challenges. By combining robust security and scalability, <inline-formula><tex-math notation="LaTeX">$S^{3}$</tex-math></inline-formula>Voting provides reliable technical support for conducting large-scale elections. Utilizing advanced technologies such as <i>Homomorphic Time-Lock Puzzle (HTLP)</i> and <i>one-time ring signature</i>, the system safeguards voters’ privacy and ballot confidentiality. The approach involves dividing voters and miners into smaller shards, and implementing shard managing mechanisms to ensure security and enhance system efficiency. Through thorough security analysis, we demonstrate that <inline-formula><tex-math notation="LaTeX">$S^{3}$</tex-math></inline-formula>Voting not only meets the fundamental security requirements of e-voting but also offers verifiability and strong robustness-essential elements for successful large-scale elections. Moreover, experimental results indicate that <inline-formula><tex-math notation="LaTeX">$S^{3}$</tex-math></inline-formula>Voting significantly reduces the computational burden on individual miners and minimizes system processing time compared to existing blockchain-based e-voting solutions.

IEEE Transactions on Dependable and Secure ComputingVol. 22(2)
University of Science and Technology of China (CN), Fordham University (US)
Openalex Percentile: Top 7%
Internet Traffic Analysis and Secure E-voting
3.13
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.