Cheater identifiable secret sharing schemes via multi-receiver authentication

Rui Xu, Kirill Morozov, Tsuyoshi Takagi

研究成果: Contribution to journalConference article査読

8 被引用数 (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.

本文言語英語
ページ(範囲)72-87
ページ数16
ジャーナルLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
8639 LNCS
DOI
出版ステータス出版済み - 2014
イベント9th International Workshop on Security, IWSEC 2014 - Hirosaki, 日本
継続期間: 8 27 20148 29 2014

All Science Journal Classification (ASJC) codes

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「Cheater identifiable secret sharing schemes via multi-receiver authentication」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル