Note on some recent cheater identifiable secret sharing schemes

Rui Xu, Kirill Morozov, Tsuyoshi Takagi

Research output: Contribution to journalArticle

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.

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

Fingerprint

Secret Sharing Scheme
Reed-Solomon codes
Reed-Solomon Codes
Coding Theory
Error Detection
Information Security
Error detection
Error correction
Security of data
Cryptography
Decoding

All Science Journal Classification (ASJC) codes

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

Cite this

Note on some recent cheater identifiable secret sharing schemes. / Xu, Rui; Morozov, Kirill; Takagi, Tsuyoshi.

In: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E98A, No. 8, 01.08.2015, p. 1814-1819.

Research output: Contribution to journalArticle

@article{553cba561eef4d1086f538c595d93265,
title = "Note on some recent cheater identifiable secret sharing schemes",
abstract = "Harn and Lin proposed an algorithm to detect and identify cheaters in Shamir{\"i}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.",
author = "Rui Xu and Kirill Morozov and Tsuyoshi Takagi",
year = "2015",
month = "8",
day = "1",
doi = "10.1587/transfun.E98.A.1814",
language = "English",
volume = "E98A",
pages = "1814--1819",
journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",
issn = "0916-8508",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "8",

}

TY - JOUR

T1 - Note on some recent cheater identifiable secret sharing schemes

AU - Xu, Rui

AU - Morozov, Kirill

AU - Takagi, Tsuyoshi

PY - 2015/8/1

Y1 - 2015/8/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84938928193&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84938928193&partnerID=8YFLogxK

U2 - 10.1587/transfun.E98.A.1814

DO - 10.1587/transfun.E98.A.1814

M3 - Article

AN - SCOPUS:84938928193

VL - E98A

SP - 1814

EP - 1819

JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

SN - 0916-8508

IS - 8

ER -