Cheater identifiable secret sharing schemes via multi-receiver authentication

Rui Xu, Kirill Morozov, Tsuyoshi Takagi

研究成果: ジャーナルへの寄稿Conference article

6 引用 (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
出版物ステータス出版済み - 1 1 2014
イベント9th International Workshop on Security, IWSEC 2014 - Hirosaki, 日本
継続期間: 8 27 20148 29 2014

Fingerprint

Secret Sharing Scheme
Authentication
Receiver
Authentication Codes
Secret Sharing
Integrity

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

これを引用

Cheater identifiable secret sharing schemes via multi-receiver authentication. / Xu, Rui; Morozov, Kirill; Takagi, Tsuyoshi.

:: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 巻 8639 LNCS, 01.01.2014, p. 72-87.

研究成果: ジャーナルへの寄稿Conference article

@article{82878712b8d841ee9e5dc922124e1e7c,
title = "Cheater identifiable secret sharing schemes via multi-receiver authentication",
abstract = "We introduce two publicly cheater identifiable secret sharing (CISS) schemes with efficient reconstruction, tolerating tn+t+2/εn+t+2 in the general case, that can be ultimately reduced to |S|(k-t)k+t+2/ε k+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+2/ε2t+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",
author = "Rui Xu and Kirill Morozov and Tsuyoshi Takagi",
year = "2014",
month = "1",
day = "1",
doi = "10.1007/978-3-319-09843-2_6",
language = "English",
volume = "8639 LNCS",
pages = "72--87",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - Cheater identifiable secret sharing schemes via multi-receiver authentication

AU - Xu, Rui

AU - Morozov, Kirill

AU - Takagi, Tsuyoshi

PY - 2014/1/1

Y1 - 2014/1/1

N2 - We introduce two publicly cheater identifiable secret sharing (CISS) schemes with efficient reconstruction, tolerating tn+t+2/εn+t+2 in the general case, that can be ultimately reduced to |S|(k-t)k+t+2/ε k+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+2/ε2t+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

AB - We introduce two publicly cheater identifiable secret sharing (CISS) schemes with efficient reconstruction, tolerating tn+t+2/εn+t+2 in the general case, that can be ultimately reduced to |S|(k-t)k+t+2/ε k+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+2/ε2t+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

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

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

U2 - 10.1007/978-3-319-09843-2_6

DO - 10.1007/978-3-319-09843-2_6

M3 - Conference article

AN - SCOPUS:84907365883

VL - 8639 LNCS

SP - 72

EP - 87

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -