An efficient ring signature scheme based on syndrome decoding problem

Siyuan Chen, Peng Zeng, Kim Kwang Raymond Choo, Qin Wang

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

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.

Original languageEnglish
Title of host publicationProceedings - 12th International Conference on Computational Intelligence and Security, CIS 2016
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages228-232
Number of pages5
ISBN (Electronic)9781509048403
DOIs
StatePublished - 17 Jan 2017
Event12th International Conference on Computational Intelligence and Security, CIS 2016 - Wuxi, Jiangsu, China
Duration: 16 Dec 201619 Dec 2016

Publication series

NameProceedings - 12th International Conference on Computational Intelligence and Security, CIS 2016

Conference

Conference12th International Conference on Computational Intelligence and Security, CIS 2016
Country/TerritoryChina
CityWuxi, Jiangsu
Period16/12/1619/12/16

Keywords

  • Anonymity
  • High efficiency
  • Ring signature
  • Syndrome decoding

Fingerprint

Dive into the research topics of 'An efficient ring signature scheme based on syndrome decoding problem'. Together they form a unique fingerprint.

Cite this