Presentation 2017-09-08
A Strongly Secure Secret Sharing Scheme with Ramp Threshold Forms a Maximum Distance Separable Code
Mikihiko Nishiara,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) It is known that ideal secret sharing schemes can be constructed from MDS (maximum distance separable) codes on a finite field. It is also known that strong secure secret sharing schemes with ramp threshold can be constructed from MDS codesif the pieces of secret and the shares take its values in a finite field. In this manuscript, we prove that any strong secure secret sharing scheme with ramp threshold has a structure ofan MDS code on a finite set that has no algebraic structure.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) secret sharing schemes / maximum distance separable codes / orthogonal arrays
Paper # IT2017-43
Date of Issue 2017-09-01 (IT)

Conference Information
Committee IT
Conference Date 2017/9/8(1days)
Place (in Japanese) (See Japanese page)
Place (in English) Centcore Yamaguchi Hotel
Topics (in Japanese) (See Japanese page)
Topics (in English) error correcting codes, general
Chair Masayoshi Ohashi(Fukuoka Univ.)
Vice Chair Jun Muramatsu(NTT)
Secretary Jun Muramatsu(Yokohama College of Commerce)
Assistant Sigeaki Kuzuoka(wakayama univ.)

Paper Information
Registration To Technical Committee on Information Theory
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) A Strongly Secure Secret Sharing Scheme with Ramp Threshold Forms a Maximum Distance Separable Code
Sub Title (in English)
Keyword(1) secret sharing schemes
Keyword(2) maximum distance separable codes
Keyword(3) orthogonal arrays
1st Author's Name Mikihiko Nishiara
1st Author's Affiliation Shinshu University(Shinshu Univ.)
Date 2017-09-08
Paper # IT2017-43
Volume (vol) vol.117
Number (no) IT-208
Page pp.pp.27-30(IT),
#Pages 4
Date of Issue 2017-09-01 (IT)