.png){kind=icon}
.png){kind=icon}
Return
Lattice-Based Blind Ring Signature With Applications to Anonymous Voting Systems
.png){kind=icon}
PRE
AI
X
S
Y
S
X
B
DOI：10.1109/tdsc.2026.3694695.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
As e-voting adoption grows, ensuring voter anonymity and ballot integrity is essential. Blind ring signatures provide both blindness and ring anonymity, enabling anonymous yet verifiable voting. However, existing schemes either rely on discrete logarithm assumptions which vulnerable to quantum adversaries, or fail to achieve both blindness and anonymity. In the post-quantum setting, only a few lattice-based blind ring signatures have appeared and suffer from large signature sizes, limiting practicality for large-scale deployments. Thus, developing practical lattice-based blind ring signature is crucial. In this work, we present LBRS, a lattice-based blind ring signature that transforms the two-round SnowBlind protocol from the discrete logarithm setting to the lattice setting while seamlessly integrating ring signature functionality. Unlike existing solutions, LBRS achieves post-quantum security while preserving blindness and introducing ring anonymity, making it robust against quantum attackers. We implement LBRS within a complete post-quantum anonymous voting architecture, ensuring end-to-end security, full voter anonymity, ballot integrity, transparent and verifiable tallying, and practical deployment. We formally prove that LBRS satisfies correctness, anonymity, blindness, and one-more unforgeability under lattice assumptions. Experiments show that LBRS offers a significant advantage in signature size and comparable time costs, positioning it as a strong candidate for large-scale, post-quantum secure elections.
Keywords:
E-voting
blind ring signature
lattice
user anonymity
message blindness
applied cryptography
Journal
IF:
7.5
Papers:
2.4K
Citations:
9.6K
Organization
Cited Papers