A New Code-Based Linkable Threshold Ring Signature Scheme

In this paper, we construct a new code-based linkable threshold signature scheme whose security is based on the hardness of the syndrome decoding problem and general syndrome decoding problem. We show that our scheme is secure in terms of existential unforgeability, anonymity, nonslanderability, and...

Full description

Saved in:
Bibliographic Details
Published inWireless communications and mobile computing Vol. 2022; no. 1
Main Authors Ren, Fang, Xiu, Haiyan, Ji, Chuxin, Zheng, Dong, Wu, Ziyi
Format Journal Article
LanguageEnglish
Published Oxford Hindawi 2022
John Wiley & Sons, Inc
Subjects
Algorithms
Coding theory
Decoding
Digital signatures
Voting systems
Online AccessGet full text
ISSN1530-8669
1530-8677
1530-8677
DOI10.1155/2022/3150714

Cover

More Information
Summary:In this paper, we construct a new code-based linkable threshold signature scheme whose security is based on the hardness of the syndrome decoding problem and general syndrome decoding problem. We show that our scheme is secure in terms of existential unforgeability, anonymity, nonslanderability, and linkability. The complexity of the signature size proposed in this paper is Ot. Our method is particularly well suited for large free group voting systems. The greater the number of members in the ring, the more pronounced the advantage of the signature length is when compared to other schemes. That is, our scheme achieves a fixed length signature, independent of the number of ring members. In addition, our scheme has a very short public key, and the size is ON.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1530-8669
1530-8677
1530-8677
DOI:10.1155/2022/3150714