| Presentation | 2021-03-05 Construction of non-malleable codes based on graph theory Shohei Satake, Yujie Gu, Kouichi Sakurai, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | Non-malleable codes protect communications against adversarial tampering of data, which can be seen as a relaxation of error-correcting codes and error-detecting codes. Recently, Rasmussen and Sahai (ITC2020) explicitly constructed non-malleable codes in the split-state model using expander graphs. In this work we extend their construction by means of bipartite expander graphs. In particular, we instantiate our construction based on some specific bipartite graphs, obtaining explicit non-malleable codes which reduce the encoding space cost in comparison with the codes by Rasmussen and Sahai. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | bipartite expander graph / graph theory / non-malleable code / information-theoretic cryptography |
| Paper # | IT2020-144,ISEC2020-74,WBS2020-63 |
| 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) | Construction of non-malleable codes based on graph theory |
| Sub Title (in English) | |
| Keyword(1) | bipartite expander graph |
| Keyword(2) | graph theory |
| Keyword(3) | non-malleable code |
| Keyword(4) | information-theoretic cryptography |
| 1st Author's Name | Shohei Satake |
| 1st Author's Affiliation | Kumamoto University(Kumamoto Univ.) |
| 2nd Author's Name | Yujie Gu |
| 2nd Author's Affiliation | Kyushu University(Kyushu Univ.) |
| 3rd Author's Name | Kouichi Sakurai |
| 3rd Author's Affiliation | Kyushu University(Kyushu Univ.) |
| Date | 2021-03-05 |
| Paper # | IT2020-144,ISEC2020-74,WBS2020-63 |
| Volume (vol) | vol.120 |
| Number (no) | IT-410,ISEC-411,WBS-412 |
| Page | pp.pp.195-200(IT), pp.195-200(ISEC), pp.195-200(WBS), |
| #Pages | 6 |
| Date of Issue | 2021-02-25 (IT, ISEC, WBS) |