A New Code-Based Linkable Threshold Ring Signature Scheme
Open Access
- 3 October 2022
- journal article
- research article
- Published by Hindawi Limited in Wireless Communications and Mobile Computing
- Vol. 2022, 1-9
- https://doi.org/10.1155/2022/3150714
Abstract
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 . 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 .Keywords
Funding Information
- Xi'an University of Posts and Telecommunications (CXJJLY202021, 22JK0560, 2022JM-353, 2021JM-463, 61902315)
This publication has 20 references indexed in Scilit:
- Linkable Ring Signature with Unconditional AnonymityIEEE Transactions on Knowledge and Data Engineering, 2013
- Efficient Linkable and/or Threshold Ring Signature Without Random OraclesThe Computer Journal, 2012
- An Improved Threshold Ring Signature Scheme Based on Error Correcting CodesLecture Notes in Computer Science, 2012
- Ring Signatures: Stronger Definitions, and Constructions Without Random OraclesLecture Notes in Computer Science, 2006
- Short Linkable Ring Signatures for E-Voting, E-Cash and AttestationLecture Notes in Computer Science, 2005
- Linkable Spontaneous Anonymous Group Signature for Ad Hoc GroupsLecture Notes in Computer Science, 2004
- How to Leak a SecretLecture Notes in Computer Science, 2001
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum ComputerSIAM Review, 1999
- A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511IEEE Transactions on Information Theory, 1998
- Group SignaturesLecture Notes in Computer Science, 1991