An Efficient Ring Signature Scheme Based on Syndrome Decoding Problem

摘要

A ring signature scheme allows a signer from a group convince the verifier that the signature is generated by a member belonging to the group but the identity of the signer is not disclosed. It is a useful tool for some scenarios where anonymity is needed to be protected. In this paper, we design a ring signature scheme based on hard problems and assumptions in coding theory. The sign and verify processes in our scheme only need to perform matrix multiplication and decoding algorithm, hence, resulting in an efficient scheme. We then prove the security and analyze the complexity of our proposed scheme.