| Presentation | 2020-05-20 [Invited Talk] Almost Optimal Cheating-Detectable (2,2,n) Ramp Secret Sharing Scheme (from CANDAR 2019) Tomoki Agematsu, Satoshi Obana, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | In this research, we consider a strong ramp secret sharing scheme (SSS for short) that can detect cheating. A cheating-detectable $(k, L, n)$ ramp SSS has been studied so far, and a strong ramp SSS which achieves lower bounds on the size of shares and random number used in encoding, and the success probability of impersonation attack has been presented. Now a challenging task is to achieve the lower bound on the success probability of substitution attack. We present a strong $(2, 2, n)$ ramp SSS that almost achieves the lower bound on the success probability of substitution attack. The proposed scheme is the first to almost achieve the lower bound. Moreover, the proposed scheme also achieves other lower bounds such as those on the size of shares and random number used in encoding, and the success probability of impersonation attack. We take a unique strategy. Most existing works use a generator matrix of any linear and strong $(k, L, n)$ ramp SSS to construct a cheating-detectable scheme. On the other hand, our proposed scheme uses a generator matrix of any linear and strong $(2, 2, n)$ ramp SSS with a certain property. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | ramp secret sharing scheme / substitution attacks / cheating detection |
| Paper # | ISEC2020-6 |
| Date of Issue | 2020-05-13 (ISEC) |
| Conference Information | |
| Committee | ISEC |
|---|---|
| Conference Date | 2020/5/20(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | Online |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | Shiho Moriai(NICT) |
| Vice Chair | Shoichi Hirose(Univ. of Fukui) / Tetsuya Izu(Fujitsu Labs.) |
| Secretary | Shoichi Hirose(NICT) / Tetsuya Izu(Tsukuba Univ.) |
| Assistant | Dai Yamamoto(Fujitsu Labs.) / Yuuji Suga(IIJ) |
| Paper Information | |
| Registration To | Technical Committee on Information Security |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | [Invited Talk] Almost Optimal Cheating-Detectable (2,2,n) Ramp Secret Sharing Scheme (from CANDAR 2019) |
| Sub Title (in English) | |
| Keyword(1) | ramp secret sharing scheme |
| Keyword(2) | substitution attacks |
| Keyword(3) | cheating detection |
| 1st Author's Name | Tomoki Agematsu |
| 1st Author's Affiliation | NEC Corporation(NEC) |
| 2nd Author's Name | Satoshi Obana |
| 2nd Author's Affiliation | Hosei university(Hosei univ) |
| Date | 2020-05-20 |
| Paper # | ISEC2020-6 |
| Volume (vol) | vol.120 |
| Number (no) | ISEC-28 |
| Page | pp.pp.27-27(ISEC), |
| #Pages | 1 |
| Date of Issue | 2020-05-13 (ISEC) |