Table of Contents Author Guidelines Submit a Manuscript

An erratum for this article has been published. To view the erratum, please click here.

Security and Communication Networks
Volume 2017, Article ID 1915239, 7 pages
Research Article

An Efficient Code-Based Threshold Ring Signature Scheme with a Leader-Participant Model

1Department of Computer and Information Technology, Zhejiang Police College, Hangzhou, Zhejiang Province, China
2Shanghai Key Laboratory of Trustworthy Computing, East China Normal University, Shanghai, China
3Department of Computer Science and Engineering, University of North Texas, Denton, TX 76203, USA
4College of Information Engineering, China University of Geosciences, Wuhan, China
5Department of Information Systems and Cyber Security, University of Texas at San Antonio, San Antonio, TX 78249, USA

Correspondence should be addressed to Xiaohui Yuan; ude.tnu@nauy.iuhoaix

Received 23 March 2017; Accepted 2 July 2017; Published 1 August 2017

Academic Editor: Mamoun Alazab

Copyright © 2017 Guomin Zhou et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


Digital signature schemes with additional properties have broad applications, such as in protecting the identity of signers allowing a signer to anonymously sign a message in a group of signers (also known as a ring). While these number-theoretic problems are still secure at the time of this research, the situation could change with advances in quantum computing. There is a pressing need to design PKC schemes that are secure against quantum attacks. In this paper, we propose a novel code-based threshold ring signature scheme with a leader-participant model. A leader is appointed, who chooses some shared parameters for other signers to participate in the signing process. This leader-participant model enhances the performance because every participant including the leader could execute the decoding algorithm (as a part of signing process) upon receiving the shared parameters from the leader. The time complexity of our scheme is close to Courtois et al.’s (2001) scheme. The latter is often used as a basis to construct other types of code-based signature schemes. Moreover, as a threshold ring signature scheme, our scheme is as efficient as the normal code-based ring signature.