On the Bound for Anonymous Secret Sharing Schemes 

作成者 岸本, 渡, Okada, Koji, 黒澤, 馨, 尾形, わかは
作成者の別表記 Kishimoto, Wataru
キーワード等 cryptography, secret sharing scheme, anonymous, Steiner system
日本十進分類法 (NDC) 410
内容 In anonymous secret sharing schemes, the secret can be reconstructed without knowledge of which participants hold which shares. In this paper, we derive a tighter lower bound on the size of the shares than the bound of Blundo and Stinson for anonymous (k,n)-threshold schemes with 1 < k < n. Our bound is tight for k = 2. We also show a close relationship between optimum anonymous (2,n)-threshold secret schemes and combinatorial designs.
コンテンツの種類 雑誌掲載論文 Journal Article
DCMI資源タイプ text
ファイル形式 application/pdf
DOI 10.1016/S0166-218X(01)00236-0
掲載誌情報 Discrete Applied Mathematics Vol.121 no.1-3 page.193-202 (20020915)
言語 英語
関連情報 (hasVersion)

Total Access Count:

679 times.

Related Materials in

secret sharing scheme
Steiner system