Cheater identifiable secret sharing schemes via multi-receiver authentication

Rui Xu, Kirill Morozov, Tsuyoshi Takagi

Research output: Contribution to journalConference articlepeer-review

10 Citations (Scopus)


We introduce two publicly cheater identifiable secret sharing (CISS) schemes with efficient reconstruction, tolerating t<k/2 cheaters. Our constructions are based on (k,n) threshold Shamir scheme, and they feature a novel application of multi-receiver authentication codes to ensure integrity of shares. The first scheme, which tolerates rushing cheaters, has the share size |S|(n-t) n+t+2n+t+2 in the general case, that can be ultimately reduced to |S|(k-t)k+t+2k+t+2 assuming that all the t cheaters are among the k reconstructing players. The second scheme, which tolerates non-rushing cheaters, has the share size |S|(n-t)2t+22t+2. These two constructions have the smallest share size among the existing CISS schemes of the same category, when the secret is a single field element. In addition, we point out that an improvement in the share size to can be achieved for a CISS tolerating t<k/3 rushing cheaters presented by Xu et al. at IWSEC 2013.

Original languageEnglish
Pages (from-to)72-87
Number of pages16
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8639 LNCS
Publication statusPublished - 2014
Event9th International Workshop on Security, IWSEC 2014 - Hirosaki, Japan
Duration: Aug 27 2014Aug 29 2014

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Cheater identifiable secret sharing schemes via multi-receiver authentication'. Together they form a unique fingerprint.

Cite this