Note on Some Recent Cheater Identifiable Secret Sharing Schemes

• XU Rui

  Graduate School of Mathematics, Kyushu University

• MOROZOV Kirill

  Institute of Mathematics for Industry, Kyushu University

• TAKAGI Tsuyoshi

  Institute of Mathematics for Industry, Kyushu University

Abstract

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.

Journal

• IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

  IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E98.A (8), 1814-1819, 2015

  The Institute of Electronics, Information and Communication Engineers

Keywords

• secret sharing
• cheater identifiable secret sharing
• cryptanalysis
• Reed-Solomon code

Details

• CRID: 1390282681286806016
• NII Article ID: 130005089910
• DOI: 10.1587/transfun.e98.a.1814
• ISSN: 17451337
• ISSN: 09168508
• Web Site: https://www.jstage.jst.go.jp/article/transfun/E98.A/8/E98.A_1814/_pdf
• Text Lang: en
• Data Source:
  • JaLC
  • Crossref
  • CiNii Articles
  • KAKEN
• Abstract License Flag: Disallowed