Presentation 1995/5/12
Lower Bound on the Size of Shares of Nonperfect Secret Sharing Schemes
Koji Okada, Kaoru Kurosawa,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In a secret sharing scheme (SS), a dealer D distributes a piece of information V_i of a secret S to each participant P_i. If we desire that |V_i|<|S|, a nonperfct SS must be used, in which there exists a semi-access set C that has some information on S, but cannot recover S. This paper first presents a general lower bound on |V_i| which includes the previous lower bounds for perfect SSs and nonperfect SSs as special cases. There exist, however, access hierarchies in which |V_i| must be larger than the general lower bound, of course. As our second contribution, we determine the optimum size of V_i for such a certain access hierarchy.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) secret sharing / nonperfect / share size
Paper #
Date of Issue

Conference Information
Committee ISEC
Conference Date 1995/5/12(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Information Security (ISEC)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Lower Bound on the Size of Shares of Nonperfect Secret Sharing Schemes
Sub Title (in English)
Keyword(1) secret sharing
Keyword(2) nonperfect
Keyword(3) share size
1st Author's Name Koji Okada
1st Author's Affiliation Department of Electrical and Electronic Engineering, Faculty of Engineering, Tokyo Institute of Technology()
2nd Author's Name Kaoru Kurosawa
2nd Author's Affiliation Department of Electrical and Electronic Engineering, Faculty of Engineering, Tokyo Institute of Technology
Date 1995/5/12
Paper #
Volume (vol) vol.95
Number (no) 27
Page pp.pp.-
#Pages 8
Date of Issue