Note on some recent cheater identifiable secret sharing schemes

Rui Xu, Kirill Morozov, Tsuyoshi Takagi

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)


Harn and Lin proposed an algorithm to detect and identify cheaters in Shamirïs secret sharing scheme in the journal Designs, Codes and Cryptography, 2009. In particular, their algorithm for cheater identification is inefficient. We point out that some of their conditions for cheater detection and identification essentially follow from those on error detection/ correction of Reed-Solomon codes, which have efficient decoding algorithms, while some other presented conditions turn out to be incorrect. The extended and improved version of the above mentioned scheme was recently presented at the conference International Computer Symposium 2012 (and the journal version appeared in the journal IET Information Security). The new scheme, which is ideal (i.e. the share size is equal to that of the secret), attempts to identify cheaters from minimal number of shares (i.e. the threshold of them). We show that the proposed cheater identification is impossible using the arguments from coding theory.

Original languageEnglish
Pages (from-to)1814-1819
Number of pages6
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Issue number8
Publication statusPublished - Aug 1 2015

All Science Journal Classification (ASJC) codes

  • Signal Processing
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering
  • Applied Mathematics


Dive into the research topics of 'Note on some recent cheater identifiable secret sharing schemes'. Together they form a unique fingerprint.

Cite this