Boolean-Based (<i>k</i>, <i>n</i>, <i>m</i>) Multi-Secret Image Sharing
Multi-secret image sharing technology shares multiple secret images among shared images for participants and the recovery requires enough shared images for fulfilling the security property. Simultaneously, the adopted Boolean method preserves high performance. The proposed (<i>k</i>, <...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2022-04-01
|
| Series: | Axioms |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2075-1680/11/5/197 |
| _version_ | 1827670384170762240 |
|---|---|
| author | Chien-Chang Chen Cheng-Shian Lin Jia-Zhan Chen |
| author_facet | Chien-Chang Chen Cheng-Shian Lin Jia-Zhan Chen |
| author_sort | Chien-Chang Chen |
| collection | DOAJ |
| description | Multi-secret image sharing technology shares multiple secret images among shared images for participants and the recovery requires enough shared images for fulfilling the security property. Simultaneously, the adopted Boolean method preserves high performance. The proposed (<i>k</i>, <i>n</i>, <i>m</i>) multi-secret image sharing scheme shares <i>m</i> secret images among <i>n</i> participants and gathering <i>k</i> participants’ shared images perfectly recovers these <i>m</i> secret images. The proposed scheme exhibits high performance because of the usage of Boolean-based processing. Moreover, the usage of a sharing matrix based strategy acquires perfect reconstruction of the secret images under (<i>k</i>, <i>n</i>) thresholds. Two proposed schemes, the source-random-mixed (<i>SRM</i>) and the source-random-separate (<i>SRS</i>) methods, are presented in this study from different strategies of sharing the random image mixed with the secret images or separated to the secret images, respectively. Moreover, the proposed <i>SRS</i> method exhibits the better sharing capacity. Experimental results show that the proposed schemes perform well on sharing efficiency and security. |
| first_indexed | 2024-03-10T03:20:16Z |
| format | Article |
| id | doaj.art-3f9ca9ab881a4d4eaeefdcc9fde3539f |
| institution | Directory Open Access Journal |
| issn | 2075-1680 |
| language | English |
| last_indexed | 2024-03-10T03:20:16Z |
| publishDate | 2022-04-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Axioms |
| spelling | doaj.art-3f9ca9ab881a4d4eaeefdcc9fde3539f2023-11-23T10:03:56ZengMDPI AGAxioms2075-16802022-04-0111519710.3390/axioms11050197Boolean-Based (<i>k</i>, <i>n</i>, <i>m</i>) Multi-Secret Image SharingChien-Chang Chen0Cheng-Shian Lin1Jia-Zhan Chen2Department of Computer Science and Information Engineering, Tamkang University, New Taipei City 25137, TaiwanDepartment of Computer Science and Information Engineering, Tamkang University, New Taipei City 25137, TaiwanDepartment of Computer Science and Information Engineering, Tamkang University, New Taipei City 25137, TaiwanMulti-secret image sharing technology shares multiple secret images among shared images for participants and the recovery requires enough shared images for fulfilling the security property. Simultaneously, the adopted Boolean method preserves high performance. The proposed (<i>k</i>, <i>n</i>, <i>m</i>) multi-secret image sharing scheme shares <i>m</i> secret images among <i>n</i> participants and gathering <i>k</i> participants’ shared images perfectly recovers these <i>m</i> secret images. The proposed scheme exhibits high performance because of the usage of Boolean-based processing. Moreover, the usage of a sharing matrix based strategy acquires perfect reconstruction of the secret images under (<i>k</i>, <i>n</i>) thresholds. Two proposed schemes, the source-random-mixed (<i>SRM</i>) and the source-random-separate (<i>SRS</i>) methods, are presented in this study from different strategies of sharing the random image mixed with the secret images or separated to the secret images, respectively. Moreover, the proposed <i>SRS</i> method exhibits the better sharing capacity. Experimental results show that the proposed schemes perform well on sharing efficiency and security.https://www.mdpi.com/2075-1680/11/5/197secret image sharingBoolean-basedmultiple sharing |
| spellingShingle | Chien-Chang Chen Cheng-Shian Lin Jia-Zhan Chen Boolean-Based (<i>k</i>, <i>n</i>, <i>m</i>) Multi-Secret Image Sharing Axioms secret image sharing Boolean-based multiple sharing |
| title | Boolean-Based (<i>k</i>, <i>n</i>, <i>m</i>) Multi-Secret Image Sharing |
| title_full | Boolean-Based (<i>k</i>, <i>n</i>, <i>m</i>) Multi-Secret Image Sharing |
| title_fullStr | Boolean-Based (<i>k</i>, <i>n</i>, <i>m</i>) Multi-Secret Image Sharing |
| title_full_unstemmed | Boolean-Based (<i>k</i>, <i>n</i>, <i>m</i>) Multi-Secret Image Sharing |
| title_short | Boolean-Based (<i>k</i>, <i>n</i>, <i>m</i>) Multi-Secret Image Sharing |
| title_sort | boolean based i k i i n i i m i multi secret image sharing |
| topic | secret image sharing Boolean-based multiple sharing |
| url | https://www.mdpi.com/2075-1680/11/5/197 |
| work_keys_str_mv | AT chienchangchen booleanbasedikiiniimimultisecretimagesharing AT chengshianlin booleanbasedikiiniimimultisecretimagesharing AT jiazhanchen booleanbasedikiiniimimultisecretimagesharing |