| Presentation | 2022-03-10 On the Optimal Construction of a Visual Cryptography Scheme with Multiple Access Structures Raiki Ioki, Hiroki Koga, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | A visual cryptography scheme (VCS) is a secret sharing scheme for digital images. In a VCS, two $n×m$ Boolean matrices, called basis matrices, are used to generate $n$ images, called shares, from a black-white secret image. Since $m$ subpixels in each share are generated from one pixel in a secret image, the $n$ shares become $m$ times larger than a secret image. Hence, minimization of $m$ is quite important. In this paper, we consider a VCS that enables secret sharing of $q$ multiple secret images under $q$ access structures. We give a construction of $2^q$ basis matrices with the minimum $m$. We solve a certain integer programming problem for the minimization of $m$. It is also shown that $2^q$ basis matrices can be explicitly constructed recursively for certain $q$ access structures which are closely related to a multipartite graph. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | visual cryptography scheme / access structures / pixel expansion / integer programming |
| Paper # | IT2021-84,ISEC2021-49,WBS2021-52,RCC2021-59 |
| Date of Issue | 2022-03-03 (IT, ISEC, WBS, RCC) |
| Conference Information | |
| Committee | IT / ISEC / RCC / WBS |
|---|---|
| Conference Date | 2022/3/10(2days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | Online |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | Joint Meeting of ISEC, IT, RCC, and WBS |
| Chair | Tadashi Wadayama(Nagoya Inst. of Tech.) / Tetsuya Izu(Fujitsu Labs.) / HUAN-BANG LI(NICT) / Masanori Hamamura(Kochi Univ. of Tech.) |
| Vice Chair | Tetsuya Kojima(Tokyo Kosen) / Noboru Kunihiro(Tsukuba Univ.) / Goichiro Hanaoka(AIST) / Shunichi Azuma(Nagoya Univ.) / Koji Ishii(Kagawa Univ.) / Takashi Shono(INTEL) / Masahiro Fujii(Utsunomiya Univ.) |
| Secretary | Tetsuya Kojima(Saitamai Univ.) / Noboru Kunihiro(Yamaguchi Univ.) / Goichiro Hanaoka(Fujitsu Labs.) / Shunichi Azuma(Ibaraki Univ.) / Koji Ishii(CRIEPI) / Takashi Shono(Osaka Univ.) / Masahiro Fujii(National Defence Academy) |
| Assistant | Masanori Hirotomo(Saga Univ.) / Takahiro Matsuda(AIST) / SHAN LIN(NICT) / Masaki Ogura(Osaka Univ.) / Masayuki Kinoshita(Chiba Univ. of Tech.) / Sun Ran(Ibaraki Univ.) |
| Paper Information | |
| Registration To | Technical Committee on Information Theory / Technical Committee on Information Security / Technical Committee on Reliable Communication and Control / Technical Committee on Wideband System |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | On the Optimal Construction of a Visual Cryptography Scheme with Multiple Access Structures |
| Sub Title (in English) | |
| Keyword(1) | visual cryptography scheme |
| Keyword(2) | access structures |
| Keyword(3) | pixel expansion |
| Keyword(4) | integer programming |
| 1st Author's Name | Raiki Ioki |
| 1st Author's Affiliation | University of Tsukuba(Tsukuba Univ.) |
| 2nd Author's Name | Hiroki Koga |
| 2nd Author's Affiliation | University of Tsukuba(Tsukuba Univ.) |
| Date | 2022-03-10 |
| Paper # | IT2021-84,ISEC2021-49,WBS2021-52,RCC2021-59 |
| Volume (vol) | vol.121 |
| Number (no) | IT-428,ISEC-429,WBS-430,RCC-431 |
| Page | pp.pp.7-12(IT), pp.7-12(ISEC), pp.7-12(WBS), pp.7-12(RCC), |
| #Pages | 6 |
| Date of Issue | 2022-03-03 (IT, ISEC, WBS, RCC) |