Presentation 2011-05-13
On the Impossibility of d-Multiplicative Non-perfect Secret Sharing
Maki YOSHIDA, Toru FUJIWARA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) An important issue of secret sharing is to characterize the d-multiplicative schemes. For the perfect schemes, it has been proved that d-multiplicative secret sharing is impossible if some d non-access subsets of players cover the whole set of players. This paper extends this result to the non-perfect schemes. Specifically, we prove that d-multiplicative secret sharing is impossible if some d semi-access and/or non-access subsets cover the whole set of players. Our result indicates no need of relaxing the privacy requirement only for the purpose of realizing d-multiplicative property.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Secret sharing / multiplicative / non-perfect / impossibility
Paper # ISEC2011-5
Date of Issue

Conference Information
Committee ISEC
Conference Date 2011/5/6(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) On the Impossibility of d-Multiplicative Non-perfect Secret Sharing
Sub Title (in English)
Keyword(1) Secret sharing
Keyword(2) multiplicative
Keyword(3) non-perfect
Keyword(4) impossibility
1st Author's Name Maki YOSHIDA
1st Author's Affiliation Graduate School of Information Science and Technology, Osaka University()
2nd Author's Name Toru FUJIWARA
2nd Author's Affiliation Graduate School of Information Science and Technology, Osaka University
Date 2011-05-13
Paper # ISEC2011-5
Volume (vol) vol.111
Number (no) 34
Page pp.pp.-
#Pages 6
Date of Issue