| Presentation | 2021-03-04 A Consideration on Evolving Secret Sharing Schemes using Linear Codes Hiroki Toriumi, Nozomi Miya, Hajime Jinushi, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | Shamir's $(k, n)$ threshold scheme is realized by linear codes on a finite field. This scheme requires that an upper bounds on the number of shares is known in advance. Even if a crude upper bound $n$ is known in advance, it is preferable to have shares as small as possible than this bound on $n$. Komargodski et al. proposed an evolving-$k$ threshold scheme, in which unbounded number of shares can be generated. Shamir's $(k, n)$ threshold scheme realized by linear codes can be extended to evolving-$k$ threshold scheme by using linear codes on some finite fields of larger order. We propose and discuss such a construction for evolving-$k$ threshold scheme. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | secret sharing scheme / $(k, n)$-threshold scheme / finite fields / linear codes / evolving-$k$ threshold scheme |
| Paper # | IT2020-132,ISEC2020-62,WBS2020-51 |
| Date of Issue | 2021-02-25 (IT, ISEC, WBS) |
| Conference Information | |
| Committee | WBS / IT / ISEC |
|---|---|
| Conference Date | 2021/3/4(2days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | Online |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | Joint Meeting of WBS, IT, and ISEC |
| Chair | Masanori Hamamura(Kochi Univ. of Tech.) / Tadashi Wadayama(Nagoya Inst. of Tech.) / Shoichi Hirose(Univ. of Fukui) |
| Vice Chair | Takashi Shono(INTEL) / Masahiro Fujii(Utsunomiya Univ.) / Tetsuya Kojima(Tokyo Kosen) / Tetsuya Izu(Fujitsu Labs.) / Noboru Kunihiro(Tsukuba Univ.) |
| Secretary | Takashi Shono(Okayama Univ. of Science) / Masahiro Fujii(National Defence Academy) / Tetsuya Kojima(Yamaguchi Univ.) / Tetsuya Izu(Saga Univ.) / Noboru Kunihiro(Tsukuba Univ.) |
| Assistant | Duong Quang Thang(NAIST) / Masafumi Moriyama(NICT) / Masayuki Kinoshita(Chiba Univ. of Tech.) / Takahiro Ohta(Senshu Univ.) / Kazuki Yoneyama(Ibaraki Univ.) |
| Paper Information | |
| Registration To | Technical Committee on Wideband System / Technical Committee on Information Theory / Technical Committee on Information Security |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | A Consideration on Evolving Secret Sharing Schemes using Linear Codes |
| Sub Title (in English) | |
| Keyword(1) | secret sharing scheme |
| Keyword(2) | $(k, n)$-threshold scheme |
| Keyword(3) | finite fields |
| Keyword(4) | linear codes |
| Keyword(5) | evolving-$k$ threshold scheme |
| 1st Author's Name | Hiroki Toriumi |
| 1st Author's Affiliation | Aoyama Gakuin University(Aoyama Gakuin Univ.) |
| 2nd Author's Name | Nozomi Miya |
| 2nd Author's Affiliation | Aoyama Gakuin University(Aoyama Gakuin Univ.) |
| 3rd Author's Name | Hajime Jinushi |
| 3rd Author's Affiliation | Aoyama Gakuin University(Aoyama Gakuin Univ.) |
| Date | 2021-03-04 |
| Paper # | IT2020-132,ISEC2020-62,WBS2020-51 |
| Volume (vol) | vol.120 |
| Number (no) | IT-410,ISEC-411,WBS-412 |
| Page | pp.pp.123-127(IT), pp.123-127(ISEC), pp.123-127(WBS), |
| #Pages | 5 |
| Date of Issue | 2021-02-25 (IT, ISEC, WBS) |