A Linkable Ring Signature Based on Polar Codes with Reusable Authorization
- 1School of Information Network Security, Xinjiang Institute of Political Science and Law, Tumxuk 843900, China
- 2School of Mathematics and Systems Science, Guangdong Polytechnic Normal University, Guangzhou 510665, China
Abstract
Post-quantum digital signatures are needed to protect authentication against quantum attacks. Code-based techniques offer a promising foundation for this goal. Linkable ring signatures additionally provide signer anonymity and public linkage, but repeated membership proofs can incur substantial communication costs. We propose a linkable ring signature based on polar codes with reusable anonymous authorization. The scheme supports independently verifiable messages, public linking across rings, and repeated signing. Under the stated primitive assumptions and honest registration, we prove unforgeability, restricted anonymity, linkability, and non-frameability in the classical random oracle model. For parameters selected against a 128-bit classical generic-attack target, the authorization proof is 98.52% shorter than the selected-matrix implementation of the same relation for a 32-member ring, and each cached online packet occupies 807 bytes. Compared with a direct-proof baseline using the same parameters, certificate reuse reduces total communication from the second message onward for all evaluated ring sizes. A prototype executes key generation, authorization, certificate installation, and online signing and verification with actual polar-code keys. For a 1024-member ring, the authorization certificate occupies 189.5 MB. For a single verifier with pre-distributed rings, total communication is lower than that of a reference linkable ring signature scheme for workloads of at least 6561 messages.
Related
BibTeX
@article{lin2026linkable,
title = {{A Linkable Ring Signature Based on Polar Codes with Reusable Authorization}},
author = {Zhiqiang Lin and Jingang Liu and Qinrui Lv},
journal = {Mathematics},
year = {2026},
month = oct,
doi = {10.3390/math14213908},
url = {https://www.mdpi.com/2227-7390/14/21/3908},
note = {CC BY 4.0},
}
RIS
TY - JOUR
TI - A Linkable Ring Signature Based on Polar Codes with Reusable Authorization
AU - Zhiqiang Lin
AU - Jingang Liu
AU - Qinrui Lv
PY - 2026
DA - 2026/10/26
JO - Mathematics
DO - 10.3390/math14213908
UR - https://www.mdpi.com/2227-7390/14/21/3908
AB - Post-quantum digital signatures are needed to protect authentication against quantum attacks. Code-based techniques offer a promising foundation for this goal. Linkable ring signatures additionally provide signer anonymity and public linkage, but repeated membership proofs can incur substantial communication costs. We propose a linkable ring signature based on polar codes with reusable anonymous authorization. The scheme supports independently verifiable messages, public linking across rings, and repeated signing. Under the stated primitive assumptions and honest registration, we prove unforgeability, restricted anonymity, linkability, and non-frameability in the classical random oracle model. For parameters selected against a 128-bit classical generic-attack target, the authorization proof is 98.52% shorter than the selected-matrix implementation of the same relation for a 32-member ring, and each cached online packet occupies 807 bytes. Compared with a direct-proof baseline using the same parameters, certificate reuse reduces total communication from the second message onward for all evaluated ring sizes. A prototype executes key generation, authorization, certificate installation, and online signing and verification with actual polar-code keys. For a 1024-member ring, the authorization certificate occupies 189.5 MB. For a single verifier with pre-distributed rings, total communication is lower than that of a reference linkable ring signature scheme for workloads of at least 6561 messages.
SN - 2227-7390
ER -